Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control最新文献_第3页

Falsification of cyber-physical systems with robustness-guided black-box checking 具有鲁棒性引导的黑盒检查的网络物理系统伪造

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-04-17 DOI: 10.1145/3365365.3382193

Masaki Waga

引用次数: 22

Compositional synthesis via a convex parameterization of assume-guarantee contracts 通过假设-担保契约的凸参数化的组合合成

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-02-16 DOI: 10.1145/3365365.3382212

K. Ghasemi, Sadra Sadraddini, C. Belta

引用次数: 22

Implicit structural analysis of multimode DAE systems 多模DAE系统的隐式结构分析

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-02-12 DOI: 10.1145/3365365.3382201

B. Caillaud, Mathias Malandain, Joan Thibault

{"title":"Implicit structural analysis of multimode DAE systems","authors":"B. Caillaud, Mathias Malandain, Joan Thibault","doi":"10.1145/3365365.3382201","DOIUrl":"https://doi.org/10.1145/3365365.3382201","url":null,"abstract":"Modeling languages and tools based on Differential Algebraic Equations (DAE) bring several specific issues that do not exist with modeling languages based on Ordinary Differential Equations. The main problem is the determination of the differentiation index and latent equations. Prior to generating simulation code and calling solvers, the compilation of a model requires a structural analysis step, which reduces the differentiation index to a level acceptable by numerical solvers. The Modelica language, among others, allows hybrid models with multiple modes, mode-dependent dynamics and state-dependent mode switching. These Multimode DAE (mDAE) systems are much harder to deal with. The main difficulties are (i) the combinatorial explosion of the number of modes, and (ii) the correct handling of mode switchings. The focus of this paper is on the first issue, namely: How can one perform a structural analysis of an mDAE in all possible modes, without enumerating these modes? A structural analysis algorithm for mDAE systems is presented, based on an implicit representation of their varying structure. It generalizes J. Pryce's Σ-method to the multimode case and uses Binary Decision Diagrams (BDD) to represent the mode-dependent structure of an mDAE. The algorithm determines, as a function of the mode, the set of latent equations, the leading variables and the state vector. This is then used to compute a conditional block dependency graph of the system, that can be used to generate efficient simulation code with a mode-dependent scheduling of the blocks of equations.","PeriodicalId":162317,"journal":{"name":"Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133533599","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}

引用次数: 13

dtControl: decision tree learning algorithms for controller representation dtControl:控制器表示的决策树学习算法

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-02-12 DOI: 10.1145/3365365.3382220

P. Ashok, Mathias Jackermeier, Pushpak Jagtap, Jan Křetínský, Maximilian Weininger, Majid Zamani

引用次数: 23

On abstraction-based controller design with output feedback 基于抽象的输出反馈控制器设计

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-02-07 DOI: 10.1145/3365365.3382219

R. Majumdar, N. Ozay, Anne-Kathrin Schmuck

{"title":"On abstraction-based controller design with output feedback","authors":"R. Majumdar, N. Ozay, Anne-Kathrin Schmuck","doi":"10.1145/3365365.3382219","DOIUrl":"https://doi.org/10.1145/3365365.3382219","url":null,"abstract":"We consider abstraction-based design of output-feedback controllers for dynamical systems with a finite set of inputs and outputs against specifications in linear-time temporal logic. The usual procedure for abstraction-based controller design (ABCD) first constructs a finite-state abstraction of the underlying dynamical system, and second, uses reactive synthesis techniques to compute an abstract state-feedback controller on the abstraction. In this context, our contribution is two-fold: (I) we define a suitable relation between the original system and its abstraction which characterizes the soundness and completeness conditions for an abstract state-feedback controller to be refined to a concrete output-feedback controller for the original system, and (II) we provide an algorithm to compute a sound finite-state abstraction fulfilling this relation. Our relation generalizes feedback-refinement relations from ABCD with state-feedback. Our algorithm for constructing sound finite-state abstractions is inspired by the simultaneous reachability and bisimulation minimization algorithm of Lee and Yannakakis. We lift their idea to the computation of an observation-equivalent system and show how sound abstractions can be obtained by stopping this algorithm at any point. Additionally, our new algorithm produces a realization of the topological closure of the input/output behavior of the original system if it is finite-state realizable.","PeriodicalId":162317,"journal":{"name":"Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129209782","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}

引用次数: 25

Compositional construction of control barrier functions for interconnected control systems 互联控制系统控制屏障函数的组合构造

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2020-02-01 DOI: 10.1145/3365365.3382196

Pushpak Jagtap, Abdalla Swikir, Majid Zamani

引用次数: 23

Symbolic controller synthesis for Büchi specifications on stochastic systems 随机系统上b<s:1> chi规范的符号控制器综合

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2019-10-27 DOI: 10.1145/3365365.3382214

R. Majumdar, Kaushik Mallik, S. Soudjani

{"title":"Symbolic controller synthesis for Büchi specifications on stochastic systems","authors":"R. Majumdar, Kaushik Mallik, S. Soudjani","doi":"10.1145/3365365.3382214","DOIUrl":"https://doi.org/10.1145/3365365.3382214","url":null,"abstract":"We consider the policy synthesis problem for continuous-state controlled Markov processes evolving in discrete time, when the specification is given as a Büchi condition (visit a set of states infinitely often). We decompose computation of the maximal probability of satisfying the Büchi condition into two steps. The first step is to compute the maximal qualitative winning set, from where the Büchi condition can be enforced with probability one. The second step is to find the maximal probability of reaching the already computed qualitative winning set. In contrast with finite-state models, we show that such a computation only gives a lower bound on the maximal probability where the gap can be non-zero. In this paper we focus on approximating the qualitative winning set, while pointing out that the existing approaches for unbounded reachability computation can solve the second step. We provide an abstraction-based technique to approximate the qualitative winning set by simultaneously using an over- and under-approximation of the probabilistic transition relation. Since we are interested in qualitative properties, the abstraction is non-probabilistic; instead, the probabilistic transitions are assumed to be under the control of a (fair) adversary. Thus, we reduce the original policy synthesis problem to a Büchi game under a fairness assumption and characterize upper and lower bounds on winning sets as nested fixed point expressions in the μ-calculus. This characterization immediately provides a symbolic algorithm scheme. Further, a winning strategy computed on the abstract game can be refined to a policy on the controlled Markov process. We describe a concrete abstraction procedure and demonstrate our algorithm on two case studies. We show that our techniques are able to provide tight approximations to the qualitative winning set for the Van der Pol oscillator and a 3-d Dubins' vehicle.","PeriodicalId":162317,"journal":{"name":"Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124695515","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}

引用次数: 32

Case study: verifying the safety of an autonomous racing car with a neural network controller 案例研究:用神经网络控制器验证自动驾驶赛车的安全性

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2019-10-24 DOI: 10.1145/3365365.3382216

Radoslav Ivanov, Taylor J. Carpenter, James Weimer, R. Alur, George J. Pappas, Insup Lee

引用次数: 53

Utilizing dependencies to obtain subsets of reachable sets 利用依赖关系获得可达集的子集

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2019-10-18 DOI: 10.1145/3365365.3382192

Niklas Kochdumper, B. Schürmann, M. Althoff

引用次数: 14

Interpretable classification of time-series data using efficient enumerative techniques 使用有效枚举技术的时间序列数据的可解释分类

Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control Pub Date : 2019-07-24 DOI: 10.1145/3365365.3382218

Sara Mohammadinejad, Jyotirmoy V. Deshmukh, Aniruddh Gopinath Puranic, Marcell Vazquez-Chanlatte, Alexandre Donzé

{"title":"Interpretable classification of time-series data using efficient enumerative techniques","authors":"Sara Mohammadinejad, Jyotirmoy V. Deshmukh, Aniruddh Gopinath Puranic, Marcell Vazquez-Chanlatte, Alexandre Donzé","doi":"10.1145/3365365.3382218","DOIUrl":"https://doi.org/10.1145/3365365.3382218","url":null,"abstract":"Cyber-physical system applications such as autonomous vehicles, wearable devices, and avionic systems generate a large volume of time-series data. Designers often look for tools to help classify and categorize the data. Traditional machine learning techniques for time-series data offer several solutions to solve these problems; however, the artifacts trained by these algorithms often lack interpretability. On the other hand, temporal logic, such as Signal Temporal Logic (STL) have been successfully used in the formal methods community as specifications of time-series behaviors. In this work, we propose a new technique to automatically learn temporal logic formulas that are able to classify real-valued time-series data. Previous work on learning STL formulas from data either assumes a formula-template to be given by the user, or assumes some special fragment of STL that enables exploring the formula structure in a systematic fashion. In our technique, we relax these assumptions, and provide a way to systematically explore the space of all STL formulas. As the space of all STL formulas is very large, and contains many semantically equivalent formulas, we suggest a technique to heuristically prune the space of formulas considered. Finally, we illustrate our technique on various case studies from the automotive and transportation domains.","PeriodicalId":162317,"journal":{"name":"Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129091482","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}

引用次数: 22