{"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].