Eric S. Kim, M. Arcak, Mahmoud Khaled, Majid Zamani
ACM Reference Format: Eric S. Kim, Murat Arcak and Mahmoud Khaled, Majid Zamani. 2018. Poster: Major Computational Breakthroughs in the Synthesis of Symbolic Controllers via Decomposed Algorithms. In HSCC ’18: 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), April 11–13, 2018, Porto, Portugal. ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/3178126.3187005
ACM参考格式:Eric S. Kim, Murat arak和Mahmoud Khaled, Majid Zamani。2018。海报:通过分解算法合成符号控制器的重大计算突破。在HSCC ' 18:第21届混合系统国际会议:计算和控制(CPS周的一部分)，2018年4月11日至13日，葡萄牙波尔图。ACM，纽约，美国，3页。https://doi.org/10.1145/3178126.3187005
{"title":"Major Computational Breakthroughs in the Synthesis of Symbolic Controllers via Decomposed Algorithms","authors":"Eric S. Kim, M. Arcak, Mahmoud Khaled, Majid Zamani","doi":"10.1145/3178126.3187005","DOIUrl":"https://doi.org/10.1145/3178126.3187005","url":null,"abstract":"ACM Reference Format: Eric S. Kim, Murat Arcak and Mahmoud Khaled, Majid Zamani. 2018. Poster: Major Computational Breakthroughs in the Synthesis of Symbolic Controllers via Decomposed Algorithms. In HSCC ’18: 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week), April 11–13, 2018, Porto, Portugal. ACM, New York, NY, USA, 3 pages. https://doi.org/10.1145/3178126.3187005","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131643778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Symbolic control aims at designing "correct by construction" controllers for continuous dynamical systems, by using algorithmic discrete synthesis techniques. The key concept in symbolic control is that of symbolic model (also called finite abstraction), which is a finite-state dynamical system, obtained by abstracting continuous trajectories over a finite set of symbols. When the symbolic and the continuous dynamics are formally related by some behavioral relationship (e.g. simulation or bisimulation relations), controllers synthesized for the symbolic model using discrete synthesis techniques can be refined to certified controllers for the original continuous system. Computation of finite abstractions is often based on discretization of the state and input spaces and therefore the symbolic control approach suffers from scalability issues. However, the design of large systems can still be tackled by means of compositional techniques. In this talk, we will present some recent results on compositional synthesis in the symbolic control approach. Firstly, we will present an approach to compute abstractions of systems made of several, possibly overlapping components. Secondly, we will show how to synthesize decentralized (and possibly asynchronous) controllers for invariance properties, by combining these overlapping abstractions and assume-guarantee contracts. In the last part of the talk, motivated by the use of parametric assume-guarantee contracts for stability properties, we will show recent developments on abstraction-based quantitative synthesis.
{"title":"Compositional Synthesis for Symbolic Control","authors":"A. Girard","doi":"10.1145/3178126.3196957","DOIUrl":"https://doi.org/10.1145/3178126.3196957","url":null,"abstract":"Symbolic control aims at designing \"correct by construction\" controllers for continuous dynamical systems, by using algorithmic discrete synthesis techniques. The key concept in symbolic control is that of symbolic model (also called finite abstraction), which is a finite-state dynamical system, obtained by abstracting continuous trajectories over a finite set of symbols. When the symbolic and the continuous dynamics are formally related by some behavioral relationship (e.g. simulation or bisimulation relations), controllers synthesized for the symbolic model using discrete synthesis techniques can be refined to certified controllers for the original continuous system. Computation of finite abstractions is often based on discretization of the state and input spaces and therefore the symbolic control approach suffers from scalability issues. However, the design of large systems can still be tackled by means of compositional techniques. In this talk, we will present some recent results on compositional synthesis in the symbolic control approach. Firstly, we will present an approach to compute abstractions of systems made of several, possibly overlapping components. Secondly, we will show how to synthesize decentralized (and possibly asynchronous) controllers for invariance properties, by combining these overlapping abstractions and assume-guarantee contracts. In the last part of the talk, motivated by the use of parametric assume-guarantee contracts for stability properties, we will show recent developments on abstraction-based quantitative synthesis.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116404132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents ROCS, an algorithmic control synthesis tool for nonlinear dynamical systems. Different from other formal control synthesis tools, it guarantees to generate a control strategy with respect to a robustly realizable specification for a nonlinear system. At the core of ROCS is the interval branch-and-bound scheme with a precision control parameter that reflects the robustness of the realizability of the specification. It also supports multiple variable precision control parameters to achieve higher efficiency.
{"title":"ROCS: A Robustly Complete Control Synthesis Tool for Nonlinear Dynamical Systems","authors":"Yinan Li, Jun Liu","doi":"10.1145/3178126.3178153","DOIUrl":"https://doi.org/10.1145/3178126.3178153","url":null,"abstract":"This paper presents ROCS, an algorithmic control synthesis tool for nonlinear dynamical systems. Different from other formal control synthesis tools, it guarantees to generate a control strategy with respect to a robustly realizable specification for a nonlinear system. At the core of ROCS is the interval branch-and-bound scheme with a precision control parameter that reflects the robustness of the realizability of the specification. It also supports multiple variable precision control parameters to achieve higher efficiency.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125989777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kyle Hsu, R. Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck
We present multi-layered abstraction-based controller synthesis, which extends standard abstraction-based controller synthesis (ABCS) algorithms for continuous-time control systems by simultaneously maintaining several "layers" of abstract systems with decreasing precision. The resulting abstract multi-layered controller uses the coarsest abstraction whenever this is feasible, and dynamically adjusts the precision---by moving to a more precise abstraction and back to a coarser abstraction---based on the structure of the given control problem. Abstract multi-layered controllers can be refined to controllers with non-uniform resolution using feedback refinement relations established between each abstract layer and the concrete system, resulting in a sound ABCS method. We provide multi-layered controller synthesis algorithms for reachability, safety, and generalized Büchi specifications; our approach can be generalized to any ω-regular objective. Our algorithms are complete relative to single-layered synthesis on the finest layer. We empirically demonstrate that multi-layered synthesis can outperform standard (single-layer) ABCS algorithms on a number of examples, despite the additional cost of constructing multiple abstract systems.
{"title":"Multi-Layered Abstraction-Based Controller Synthesis for Continuous-Time Systems","authors":"Kyle Hsu, R. Majumdar, Kaushik Mallik, Anne-Kathrin Schmuck","doi":"10.1145/3178126.3178143","DOIUrl":"https://doi.org/10.1145/3178126.3178143","url":null,"abstract":"We present multi-layered abstraction-based controller synthesis, which extends standard abstraction-based controller synthesis (ABCS) algorithms for continuous-time control systems by simultaneously maintaining several \"layers\" of abstract systems with decreasing precision. The resulting abstract multi-layered controller uses the coarsest abstraction whenever this is feasible, and dynamically adjusts the precision---by moving to a more precise abstraction and back to a coarser abstraction---based on the structure of the given control problem. Abstract multi-layered controllers can be refined to controllers with non-uniform resolution using feedback refinement relations established between each abstract layer and the concrete system, resulting in a sound ABCS method. We provide multi-layered controller synthesis algorithms for reachability, safety, and generalized Büchi specifications; our approach can be generalized to any ω-regular objective. Our algorithms are complete relative to single-layered synthesis on the finest layer. We empirically demonstrate that multi-layered synthesis can outperform standard (single-layer) ABCS algorithms on a number of examples, despite the additional cost of constructing multiple abstract systems.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127345366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present a demo of DryVR 2.0, a framework for verification and controller synthesis of cyber-physical systems composed of black-box simulators and white-box automata. For verification, DryVR 2.0 takes as input a black-box simulator, a white-box transition graph, a time bound and a safety specification. As output it generates over-approximations of the reachable states and returns "Safe" if the system meets the given bounded safety specification, or it returns "Unsafe" with a counter-example. For controller synthesis, DryVR 2.0 takes as input black-box simulator(s) and a reach-avoid specification, and uses RRTs to find a transition graph such that the combined system satisfies the given specification.
{"title":"DryVR 2.0: A tool for verification and controller synthesis of black-box cyber-physical systems","authors":"Bolun Qi, Chuchu Fan, Minghao Jiang, S. Mitra","doi":"10.1145/3178126.3187008","DOIUrl":"https://doi.org/10.1145/3178126.3187008","url":null,"abstract":"We present a demo of DryVR 2.0, a framework for verification and controller synthesis of cyber-physical systems composed of black-box simulators and white-box automata. For verification, DryVR 2.0 takes as input a black-box simulator, a white-box transition graph, a time bound and a safety specification. As output it generates over-approximations of the reachable states and returns \"Safe\" if the system meets the given bounded safety specification, or it returns \"Unsafe\" with a counter-example. For controller synthesis, DryVR 2.0 takes as input black-box simulator(s) and a reach-avoid specification, and uses RRTs to find a transition graph such that the combined system satisfies the given specification.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129287100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Session details: Reachability","authors":"S. Mitra","doi":"10.1145/3258025","DOIUrl":"https://doi.org/10.1145/3258025","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126364535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a dense-time real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice.
{"title":"Efficient Parametric Identification for STL","authors":"Alexey Bakhirkin, Thomas Ferrère, O. Maler","doi":"10.1145/3178126.3178132","DOIUrl":"https://doi.org/10.1145/3178126.3178132","url":null,"abstract":"We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a dense-time real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122203480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider a new way of describing complex control problems for dynamic systems called hybrid programs. Hybrid program is a finite state automaton whose states describe elementary tasks of reachability and safety defined on a transition system ([3, 5]). The proposed approach to complex control problems description could be seen as an alternative to linear temporal logic (see e.g. [1]). We provide an example to illustrate the approach.
{"title":"Formal Controller Synthesis from Hybrid Programs","authors":"V. Sinyakov, A. Girard","doi":"10.1145/3178126.3186998","DOIUrl":"https://doi.org/10.1145/3178126.3186998","url":null,"abstract":"We consider a new way of describing complex control problems for dynamic systems called hybrid programs. Hybrid program is a finite state automaton whose states describe elementary tasks of reachability and safety defined on a transition system ([3, 5]). The proposed approach to complex control problems description could be seen as an alternative to linear temporal logic (see e.g. [1]). We provide an example to illustrate the approach.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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].
{"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":"https://doi.org/10.1145/3178126.3187000","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.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124189513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Monitoring system behaviors using formal specifications appears to be an effective technique in analyzing cyber-physical systems. However, to achieve intended results in monitoring, specification languages need to be intuitive, elegant, and expressive at the first place. In this paper, we propose a metric extension of well-known Halpern-Shoham (hs) logic, called Metric Compass Logic (mcl), for monitoring purposes. Originally proposed for high-level temporal reasoning, the logic hs is very expressive and enables users to specify many temporal patterns in an intuitive and elegant way. As our main contribution, we present an offline monitoring technique for timed patterns specified in mcl. Our solution is built upon the framework developed for timed regular expressions (TRE) matching but explores a different (logical) direction. We finally study several practical features concerning atomic formulas and discuss a combined timed pattern speciication language with TRE.
{"title":"Specifying Timed Patterns using Temporal Logic","authors":"Dogan Ulus, O. Maler","doi":"10.1145/3178126.3178129","DOIUrl":"https://doi.org/10.1145/3178126.3178129","url":null,"abstract":"Monitoring system behaviors using formal specifications appears to be an effective technique in analyzing cyber-physical systems. However, to achieve intended results in monitoring, specification languages need to be intuitive, elegant, and expressive at the first place. In this paper, we propose a metric extension of well-known Halpern-Shoham (hs) logic, called Metric Compass Logic (mcl), for monitoring purposes. Originally proposed for high-level temporal reasoning, the logic hs is very expressive and enables users to specify many temporal patterns in an intuitive and elegant way. As our main contribution, we present an offline monitoring technique for timed patterns specified in mcl. Our solution is built upon the framework developed for timed regular expressions (TRE) matching but explores a different (logical) direction. We finally study several practical features concerning atomic formulas and discuss a combined timed pattern speciication language with TRE.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125203154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：