Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)最新文献

筛选
英文 中文
Graphical Hybrid Automata with Simulink and Stateflow 图形混合自动机与Simulink和状态流
A. Rajhans, S. Avadhanula, A. Chutinan, P. Mosterman, Fu Zhang
{"title":"Graphical Hybrid Automata with Simulink and Stateflow","authors":"A. Rajhans, S. Avadhanula, A. Chutinan, P. Mosterman, Fu Zhang","doi":"10.1145/3178126.3187007","DOIUrl":"https://doi.org/10.1145/3178126.3187007","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"26 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":"125509104","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}
引用次数: 3
ROCS: A Robustly Complete Control Synthesis Tool for Nonlinear Dynamical Systems 非线性动力系统的鲁棒完整控制综合工具
Yinan Li, Jun Liu
{"title":"ROCS: A Robustly Complete Control Synthesis Tool for Nonlinear Dynamical Systems","authors":"Yinan Li, Jun Liu","doi":"10.1145/3178126.3187006","DOIUrl":"https://doi.org/10.1145/3178126.3187006","url":null,"abstract":"This demo abstract 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. The functionality and usability of ROCS will be illustrated through examples.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"23 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":"127664138","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}
引用次数: 2
Under-Approximating Reach Sets for Polynomial Continuous Systems 多项式连续系统的欠逼近达集
Bai Xue, M. Fränzle, N. Zhan
{"title":"Under-Approximating Reach Sets for Polynomial Continuous Systems","authors":"Bai Xue, M. Fränzle, N. Zhan","doi":"10.1145/3178126.3178133","DOIUrl":"https://doi.org/10.1145/3178126.3178133","url":null,"abstract":"In this paper we suggest a method based on convex programming for computing semi-algebraic under-approximations of reach sets for polynomial continuous systems with initial sets being the zero sub-level set of a polynomial function. It is well-known that the reachable set can be formulated as the zero sub-level set of a value function to a Hamilton-Jacobi partial differential equation (HJE), and our approach in this paper consequently focuses on searching for approximate analytical polynomial solutions to associated HJEs, of which the zero sub-level sets converge to the exact reachable set from inside in measure, without discretizing the state space. Such approximate solutions can be computed via a classical hierarchy of convex programs consisting of linear matrix inequalities, which are constructed by sum-of-squares decomposition techniques. In contrast to traditional numerical methods approximately solving HJEs, such as level-set methods, our method reduces HJE solving to convex optimization, avoiding the complexity associated to gridding the state space. Compared to existing approaches computing under-approximations, the approach described in this paper is structurally simpler as the under-approximations are the outcome of a single semi-definite program. Furthermore, an over-approximation of the reach set, shedding light on the quality of the constructed under-approximation, can be constructed via solving the same semi-definite program. Several illustrative examples and comparisons with existing methods demonstrate the merits of our approach.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"13 49 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":"129678845","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}
引用次数: 14
Session details: Abstracts for Demos and Posters 会议细节:演示和海报摘要
Jens Oehlerking
{"title":"Session details: Abstracts for Demos and Posters","authors":"Jens Oehlerking","doi":"10.1145/3258033","DOIUrl":"https://doi.org/10.1145/3258033","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"16 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":"126480051","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}
引用次数: 0
Session details: Stabilization and Control Design 会议细节:稳定和控制设计
J. Kapinski
{"title":"Session details: Stabilization and Control Design","authors":"J. Kapinski","doi":"10.1145/3258027","DOIUrl":"https://doi.org/10.1145/3258027","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"4 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":"115184163","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}
引用次数: 0
Scalable Underapproximative Verification of Stochastic LTI Systems using Convexity and Compactness 基于凸性和紧性的随机LTI系统的可扩展欠逼近验证
Abraham P. Vinod, Meeko Oishi
{"title":"Scalable Underapproximative Verification of Stochastic LTI Systems using Convexity and Compactness","authors":"Abraham P. Vinod, Meeko Oishi","doi":"10.1145/3178126.3178148","DOIUrl":"https://doi.org/10.1145/3178126.3178148","url":null,"abstract":"We present a scalable algorithm to construct a polytopic underapproximation of the terminal hitting time stochastic reach-avoid set, for the verification of high-dimensional stochastic LTI systems with arbitrary stochastic disturbance. We prove the existence of a polytopic underapproximation by characterizing the sufficient conditions under which the stochastic reach-avoid set and the proposed open-loop underapproximation are compact and convex. We construct the polytopic underapproximation by formulating and solving a series of convex optimization problems. These set-theoretic properties also characterize circumstances under which the stochastic reach-avoid problem admits a bang-bang optimal Markov policy. We demonstrate the scalability of our algorithm on a 40D chain of integrators, the highest dimensional example demonstrated to date for stochastic reach-avoid problems, and compare its performance with existing approaches on a spacecraft rendezvous and docking problem.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"1 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":"131951495","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}
引用次数: 29
Algorithms for exact and approximate linear abstractions of polynomial continuous systems 多项式连续系统的精确和近似线性抽象算法
Michele Boreale
{"title":"Algorithms for exact and approximate linear abstractions of polynomial continuous systems","authors":"Michele Boreale","doi":"10.1145/3178126.3178137","DOIUrl":"https://doi.org/10.1145/3178126.3178137","url":null,"abstract":"A polynomial continuous system S = (F,X0) is specified by a polynomial vector field F and a set of initial conditions X0. We study polynomial changes of bases that transform S into a linear system, called linear abstractions. We first give a complete algorithm to find all such abstractions that fit a user-specified template. This requires taking into account the algebraic structure of the set X0, which we do by working modulo an appropriate invariant ideal. Next, we give necessary and sufficient syntactic conditions under which a full linear abstraction exists, that is one capable of representing the behaviour of the individual variables in the original system. We then propose an approximate linearization and dimension-reduction technique, that is amenable to be implemented \"on the fly\". We finally illustrate the encouraging results of a preliminary experimentation with the linear abstraction algorithm, conducted on challenging systems drawn from the literature.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"64 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":"114837755","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}
引用次数: 9
Constructing Control System Abstractions from Modular Components 从模块化组件构建控制系统抽象
Eric S. Kim, M. Arcak, Majid Zamani
{"title":"Constructing Control System Abstractions from Modular Components","authors":"Eric S. Kim, M. Arcak, Majid Zamani","doi":"10.1145/3178126.3178144","DOIUrl":"https://doi.org/10.1145/3178126.3178144","url":null,"abstract":"This paper tackles the problem of constructing finite abstractions for formal controller synthesis with high dimensional systems. We develop a theory of abstraction for discrete time nonlinear systems that are equipped with variables acting as interfaces for other systems. Systems interact via an interconnection map which constrains the value of system interface variables. An abstraction of a high dimensional interconnected system is obtained by composing subsystem abstractions with an abstraction of the interconnection. System abstractions are modular in the sense that they can be rearranged, substituted, or reused in configurations that were unknown during the time of abstraction. Constructing the abstraction of the interconnection map can become computationally infeasible when there are many systems. We introduce intermediate variables which break the interconnection and the abstraction procedure apart into smaller problems. Examples showcase the abstraction of a 24-dimensional system through the composition of 24 individual systems, and the synthesis of a controller for a 6-dimensional system with a consensus objective.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"42 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":"116814600","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}
引用次数: 27
Bisimulations, logics, and trace distributions for stochastic systems with rewards 具有奖励的随机系统的双模拟、逻辑和跟踪分布
Daniel Gburek, C. Baier
{"title":"Bisimulations, logics, and trace distributions for stochastic systems with rewards","authors":"Daniel Gburek, C. Baier","doi":"10.1145/3178126.3178139","DOIUrl":"https://doi.org/10.1145/3178126.3178139","url":null,"abstract":"Stochastic systems with rewards yield a generic stochastic model where both the state and the action space might be uncountable and where every action is decorated by a real-valued reward. For every deterministic stochastic system with rewards we prove that the bisimulation relation and the trace-distribution relation collapse. As a second result, we also establish a characterisation of the bisimulation relation in terms of an expressive action-based probabilistic logic and show that this characterisation is still maintained by a small fragment of this logic.","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"100 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":"127507214","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}
引用次数: 3
Session details: Timed Systems 会话细节:定时系统
Vinayak S. Prabhu
{"title":"Session details: Timed Systems","authors":"Vinayak S. Prabhu","doi":"10.1145/3258026","DOIUrl":"https://doi.org/10.1145/3258026","url":null,"abstract":"","PeriodicalId":131076,"journal":{"name":"Proceedings of the 21st International Conference on Hybrid Systems: Computation and Control (part of CPS Week)","volume":"1 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":"130850203","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信