A categorical approach to open and interconnected dynamical systems

Brendan Fong, P. Rapisarda, Pawel Soboci'nski
{"title":"A categorical approach to open and interconnected dynamical systems","authors":"Brendan Fong, P. Rapisarda, Pawel Soboci'nski","doi":"10.1145/2933575.2934556","DOIUrl":null,"url":null,"abstract":"In his 1986 Automatica paper Willems introduced the influential behavioural approach to control theory with an investigation of linear time-invariant (LTI) discrete dynamical systems. The behavioural approach places open systems at its centre, modelling by tearing, zooming, and linking. We show that these ideas are naturally expressed in the language of symmetric monoidal categories.Our main result gives an intuitive sound and fully complete string diagram algebra for reasoning about LTI systems. These string diagrams are closely related to the classical notion of signal flow graphs, endowed with semantics as multi-input multi-output transducers that process discrete streams with an infinite past as well as an infinite future. At the categorical level, the algebraic characterisation is that of the prop of corelations.Using this framework, we derive a novel structural characterisation of controllability, and consequently provide a methodology for analysing controllability of networked and interconnected systems. We argue that this has the potential of providing elegant, simple, and efficient solutions to problems arising in the analysis of systems over networks, a vibrant research area at the crossing of control theory and computer science.","PeriodicalId":206395,"journal":{"name":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"44","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2933575.2934556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 44

Abstract

In his 1986 Automatica paper Willems introduced the influential behavioural approach to control theory with an investigation of linear time-invariant (LTI) discrete dynamical systems. The behavioural approach places open systems at its centre, modelling by tearing, zooming, and linking. We show that these ideas are naturally expressed in the language of symmetric monoidal categories.Our main result gives an intuitive sound and fully complete string diagram algebra for reasoning about LTI systems. These string diagrams are closely related to the classical notion of signal flow graphs, endowed with semantics as multi-input multi-output transducers that process discrete streams with an infinite past as well as an infinite future. At the categorical level, the algebraic characterisation is that of the prop of corelations.Using this framework, we derive a novel structural characterisation of controllability, and consequently provide a methodology for analysing controllability of networked and interconnected systems. We argue that this has the potential of providing elegant, simple, and efficient solutions to problems arising in the analysis of systems over networks, a vibrant research area at the crossing of control theory and computer science.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
开放和相互联系的动力系统的分类方法
在他1986年的Automatica论文中,Willems通过对线性时不变(LTI)离散动力系统的研究,介绍了控制理论的影响行为方法。行为方法将开放系统置于其中心,通过撕裂、缩放和链接来建模。我们证明了这些思想可以用对称一元范畴的语言自然地表达出来。我们的主要结果为LTI系统的推理提供了一个直观、健全和完全完备的弦图代数。这些弦图与信号流图的经典概念密切相关,具有多输入多输出换能器的语义,可以处理具有无限过去和无限未来的离散流。在范畴的层次上,代数的表征是相关的支柱的表征。利用这个框架,我们推导出一种新的可控性结构特征,从而提供了一种分析网络化和互联系统可控性的方法。我们认为,这有可能为网络系统分析中出现的问题提供优雅、简单和有效的解决方案,这是控制理论和计算机科学交叉的一个充满活力的研究领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantitative Algebraic Reasoning Differential Refinement Logic* Minimization of Symbolic Tree Automata Graphs of relational structures: restricted types The Complexity of Coverability in ν-Petri Nets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1