Compositional Synthesis of Finite Abstractions for Networks of Systems: A Dissipativity Approach

Abdalla Swikir, A. Girard, Majid Zamani
{"title":"Compositional Synthesis of Finite Abstractions for Networks of Systems: A Dissipativity Approach","authors":"Abdalla Swikir, A. Girard, Majid Zamani","doi":"10.1145/3178126.3187000","DOIUrl":null,"url":null,"abstract":"IONS In the previous sections, concrete systems and their abstractions were considered as general discrete-time control systems, deterministic or nondeterministic, finite or infinite, that can be related to each other through a storage function (in the case of subsystems) or an alternating simulation function (in the case of interconnected systems). In this section, we consider infinite, deterministic, control subsystems and provide a way of constructing their finite abstractions together with their corresponding storage functions. The construction of the finite abstraction is performed in a straightforward way. Simply, the finite state and input sets of the finite abstraction are constructed by gridding the state and input sets of the concrete subsystem with suitable grid sizes. Moreover, the transitions between those finite states are established as follows: given an initial cell and a discrete input, the concrete system is simulated for one iteration starting from the center of the cell and under the discrete input. The simulated point is contained in a cell of the grid. This implies existence of a transition between the center of the initial cell and the one containing the simulated point under the given discrete input. This is performed for all grid cells and all possible discrete inputs as defined formally in [9, Definition 7]. 5 CONSTRUCTION OF STORAGE FUNCTIONS The storage function from the finite abstraction to the concrete subsystem and vice versa is established under the assumption that the original discrete-time control subsystem is so-called incrementally passivable [9, Definition 5]. Such an incremental passivity property is described based on the existence of a function satisfying some conditions. Then, under some mild assumptions, it can be shown that this function is actually a storage function from the concrete subsystem to its finite abstraction and vice versa. Note that any stabilizable linear control system and some incrementally stabilizable control systems satisfy this property [9, Remark 3].","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3178126.3187000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

IONS In the previous sections, concrete systems and their abstractions were considered as general discrete-time control systems, deterministic or nondeterministic, finite or infinite, that can be related to each other through a storage function (in the case of subsystems) or an alternating simulation function (in the case of interconnected systems). In this section, we consider infinite, deterministic, control subsystems and provide a way of constructing their finite abstractions together with their corresponding storage functions. The construction of the finite abstraction is performed in a straightforward way. Simply, the finite state and input sets of the finite abstraction are constructed by gridding the state and input sets of the concrete subsystem with suitable grid sizes. Moreover, the transitions between those finite states are established as follows: given an initial cell and a discrete input, the concrete system is simulated for one iteration starting from the center of the cell and under the discrete input. The simulated point is contained in a cell of the grid. This implies existence of a transition between the center of the initial cell and the one containing the simulated point under the given discrete input. This is performed for all grid cells and all possible discrete inputs as defined formally in [9, Definition 7]. 5 CONSTRUCTION OF STORAGE FUNCTIONS The storage function from the finite abstraction to the concrete subsystem and vice versa is established under the assumption that the original discrete-time control subsystem is so-called incrementally passivable [9, Definition 5]. Such an incremental passivity property is described based on the existence of a function satisfying some conditions. Then, under some mild assumptions, it can be shown that this function is actually a storage function from the concrete subsystem to its finite abstraction and vice versa. Note that any stabilizable linear control system and some incrementally stabilizable control systems satisfy this property [9, Remark 3].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
系统网络有限抽象的组合综合:耗散性方法
在前面的章节中,具体系统及其抽象被认为是一般的离散时间控制系统,确定的或不确定的,有限的或无限的,它们可以通过存储函数(在子系统的情况下)或交替模拟函数(在互联系统的情况下)相互关联。在本节中,我们将考虑无限的、确定性的控制子系统,并提供一种构造其有限抽象及其相应存储函数的方法。有限抽象的构造以一种直接的方式进行。简单地说,就是将具体子系统的状态和输入集用合适的网格大小进行网格化,从而构造有限抽象的有限状态和输入集。并且,这些有限状态之间的转换建立如下:给定初始单元格和离散输入,从单元格中心开始,在离散输入下对具体系统进行一次迭代模拟。模拟点包含在网格的一个单元中。这意味着在给定的离散输入下,初始单元中心和包含模拟点的单元中心之间存在一个过渡。这对所有网格单元和所有可能的离散输入执行,如[9,定义7]中正式定义的那样。在假定原始的离散时间控制子系统是所谓的增量被动的前提下,建立了从有限抽象到具体子系统以及从具体子系统到抽象的存储函数[9,定义5]。基于满足某些条件的函数的存在性,描述了这种增量无源性。然后,在一些温和的假设下,可以证明这个函数实际上是一个从具体子系统到有限抽象的存储函数,反之亦然。注意,任何可稳定的线性控制系统和一些增量可稳定的控制系统都满足这个性质[9,注释3]。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Session details: Modeling and Verification Algorithms for exact and approximate linear abstractions of polynomial continuous systems Formal Controller Synthesis from Hybrid Programs Session details: Stabilization and Control Design Compositional Synthesis for Symbolic Control
×
引用
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