{"title":"Formal verification of weakly-hard systems","authors":"Chao Huang, Wenchao Li, Qi Zhu","doi":"10.1145/3302504.3311811","DOIUrl":"https://doi.org/10.1145/3302504.3311811","url":null,"abstract":"Weakly-hard systems are real-time systems that can tolerate occasional deadline misses in a bounded manner. Compared with traditional systems with hard deadline constraints, they provide more scheduling flexibility, and thus expand the design space for system configuration and reconfiguration. A key question for such a system is precisely to what degree it can tolerate deadline misses while still meeting its functional requirements. In this paper, we provide a formal treatment to the verification problem of a general class of weakly-hard systems. We discuss relaxation and over-approximation techniques for managing the complexity of reachability analysis, and develop algorithms based upon these for verifying the safety of weakly-hard systems. Experiments demonstrate the effectiveness of our approach in understanding the impact of and guiding the selection among different weakly-hard constraints.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125892512","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":"SReachTools: A MATLAB stochastic reachability toolbox: demo abstract","authors":"Abraham P. Vinod, Joseph D. Gleason, Meeko Oishi","doi":"10.1145/3302504.3313352","DOIUrl":"https://doi.org/10.1145/3302504.3313352","url":null,"abstract":"In this demo, we present SReachTools, an open-source MATLAB toolbox for performing stochastic reachability of linear, potentially time-varying, discrete-time systems that are perturbed by a stochastic disturbance [8]. The toolbox addresses the problem of stochastic reachability of a target tube, which also encompasses the terminal-time hitting reach-avoid [7] and viability problems [1]. As illustrated in Figure 1, the stochastic reachability of a target tube problem maximizes the likelihood that the state of a stochastic system will remain within a collection of time-varying target sets for a give time horizon, while respecting the system dynamics and bounded control authority [9]. We are interested in the computation of the stochastic reach set, denoted by LSR(α), which is the set of initial states that satisfy the reach/safety specification with a likelihood above α, and the associated optimal, admissible controller.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130668726","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}
Nikola Benes, L. Brim, Jana Drazanová, Samuel Pastva, David Šafránek
{"title":"Facetal abstraction for non-linear dynamical systems based on δ-decidable SMT","authors":"Nikola Benes, L. Brim, Jana Drazanová, Samuel Pastva, David Šafránek","doi":"10.1145/3302504.3311793","DOIUrl":"https://doi.org/10.1145/3302504.3311793","url":null,"abstract":"Formal analysis of non-linear continuous and hybrid systems is a hot topic. A common approach builds on computing a suitable finite discrete abstraction of the continuous system. In this paper, we propose a facetal abstraction which eliminates certain drawbacks of existing abstractions. The states of our abstraction are built primarily from facets of a polytopal partitioning of the system's state space taking thus into account the flow of the continuous dynamics and leading to global over-approximation. The transition system construction is based on queries solved by a δ-decision SMT-solver. The method is evaluated on several case studies.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123680313","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":"Safety control with preview automaton: poster abstract","authors":"Zexiang Liu, N. Ozay","doi":"10.1145/3302504.3313360","DOIUrl":"https://doi.org/10.1145/3302504.3313360","url":null,"abstract":"In this work we consider control problems for discrete-time dynamical systems with safety constraints. As opposed to the existing work on similar problems, we assume that the system at run-time can preview some of the future uncontrolled inputs (e.g., disturbances). In order to develop a control synthesis technique that can leverage such preview information, we introduce a mathematical construct called Preview Automaton that incorporates system dynamics with the prior knowledge on the structure of the preview. We propose an algorithm to find the maximum controlled invariant set for the Preview Automaton. Although Preview Automaton can be equivalently represented by a Finite Transition System, for which existing control synthesis methods can be applied, we show that exploiting the structure of the Preview Automaton results in more efficient solution algorithms. These ideas are demonstrated with a lane-keeping problem, where we show that existence of the preview information allows the vehicle to safely navigate roads with larger curvature, whereas the problem becomes infeasible when no preview information is available.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124087355","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":"Characterizations of safety in hybrid inclusions via barrier functions","authors":"M. Maghenem, R. Sanfelice","doi":"10.1145/3302504.3311816","DOIUrl":"https://doi.org/10.1145/3302504.3311816","url":null,"abstract":"This paper investigates characterizations of safety in terms of barrier functions for hybrid systems modeled by hybrid inclusions. After introducing an adequate definition of safety for hybrid inclusions, sufficient conditions using continuously differentiable as well as lower semicontinuous barrier functions are proposed. Furthermore, the lack of existence of autonomous and continuous barrier functions certifying safety, guides us to propose, inspired by converse Lyapunov theorems for only stability, nonautonomous barrier functions and conditions that are shown to be both necessary as well as sufficient, provided that mild regularity conditions on the system's dynamics holds.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"2011 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125629845","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":"StocHy - automated verification and synthesis of stochastic processes: poster abstract","authors":"Nathalie Cauchi, A. Abate","doi":"10.1145/3302504.3313349","DOIUrl":"https://doi.org/10.1145/3302504.3313349","url":null,"abstract":"Stochastic hybrid systems (SHS) are a rich mathematical modelling framework capable of describing complex systems, where uncertainty and hybrid (that is, both continuous and discrete) components are relevant. We introduce a new software tool - StocHy-aimed at simplifying both the modelling of SHS and their analysis. StocHy can (i) perform verification tasks, e.g., compute the probability of staying within a certain region of the state space from a given set of initial conditions; (ii) automatically synthesise strategies maximising this probability, and (iii) simulate the SHS evolution over time. We highlight the performance of StocHy, via a set of experiment that are run on a standard laptop, with an Intel Core i7-8550U CPU at 1.80GHz × 8 and with 8 GB of RAM. StocHy is available at gitlab.com/natchi92/StocHy.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115895478","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}
S. Bogomolov, M. Forets, Goran Frehse, Kostiantyn Potomkin, Christian Schilling
{"title":"JuliaReach","authors":"S. Bogomolov, M. Forets, Goran Frehse, Kostiantyn Potomkin, Christian Schilling","doi":"10.1145/3302504.3311804","DOIUrl":"https://doi.org/10.1145/3302504.3311804","url":null,"abstract":"We present JuliaReach, a toolbox for set-based reachability analysis of dynamical systems. JuliaReach consists of two main packages: Reachability, containing implementations of reachability algorithms for continuous and hybrid systems, and LazySets, a standalone library that implements state-of-the-art algorithms for calculus with convex sets. The library offers both concrete and lazy set representations, where the latter stands for the ability to delay set computations until they are needed. The choice of the programming language Julia and the accompanying documentation of our toolbox allow researchers to easily translate set-based algorithms from mathematics to software in a platform-independent way, while achieving runtime performance that is comparable to statically compiled languages. Combining lazy operations in high dimensions and explicit computations in low dimensions, JuliaReach can be applied to solve complex, large-scale problems.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125748312","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}
Sergiy Bogomolov, Goran Frehse, Amit Gurung, Dongxu Li, G. Martius, Rajarshi Ray
{"title":"Falsification of hybrid systems using symbolic reachability and trajectory splicing","authors":"Sergiy Bogomolov, Goran Frehse, Amit Gurung, Dongxu Li, G. Martius, Rajarshi Ray","doi":"10.1145/3302504.3311813","DOIUrl":"https://doi.org/10.1145/3302504.3311813","url":null,"abstract":"The falsification of a hybrid system aims at finding trajectories that violate a given safety property. This is a challenging problem, and the practical applicability of current falsification algorithms still suffers from their high time complexity. In contrast to falsification, verification algorithms aim at providing guarantees that no such trajectories exist. Recent symbolic reachability techniques are capable of efficiently computing linear constraints that enclose all trajectories of the system with reasonable precision. In this paper, we leverage the power of symbolic reachability algorithms to improve the scalability of falsification techniques. Recent approaches to falsification reduce the problem to a nonlinear optimization problem. We propose to reduce the search space of the optimization problem by adding linear state constraints obtained with a reachability algorithm. We showcase the efficiency of our approach on a number of standard hybrid systems benchmarks demonstrating the performance increase in speed and number of falsifyable instances.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129575905","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":"A complete characterization of the ordering of path-complete methods","authors":"M. Philippe, R. Jungers","doi":"10.1145/3302504.3311803","DOIUrl":"https://doi.org/10.1145/3302504.3311803","url":null,"abstract":"We study criteria allowing to compare the conservativeness of stability certificates for switching systems. The stability certificates under consideration are Path-Complete Lyapunov functions (PCLFs), which are multiple Lyapunov functions with an underlying combinatorial structure. Several criteria exist to compare these certificates and we focus here on the recently introduced concept of simulation. This criterion, which is borrowed from automata theory, relies only on the combinatorial structures that underlie the PCLFs. We show that the concept of simulation provides a complete characterization of the ordering relation between PCLFs, independently of the algebraic properties of the dynamical system studied and the template of Lyapunov functions used. We summarize the state of the art on the comparison of PCLFs and raise future research directions.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122384689","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}
Radoslav Ivanov, James Weimer, R. Alur, George J. Pappas, Insup Lee
{"title":"Verisig","authors":"Radoslav Ivanov, James Weimer, R. Alur, George J. Pappas, Insup Lee","doi":"10.1145/3302504.3311806","DOIUrl":"https://doi.org/10.1145/3302504.3311806","url":null,"abstract":"This paper presents Verisig, a hybrid system approach to verifying safety properties of closed-loop systems using neural networks as controllers. We focus on sigmoid-based networks and exploit the fact that the sigmoid is the solution to a quadratic differential equation, which allows us to transform the neural network into an equivalent hybrid system. By composing the network's hybrid system with the plant's, we transform the problem into a hybrid system verification problem which can be solved using state-of-the-art reachability tools. We show that reachability is decidable for networks with one hidden layer and decidable for general networks if Schanuel's conjecture is true. We evaluate the applicability and scalability of Verisig in two case studies, one from reinforcement learning and one in which the neural network is used to approximate a model predictive controller.","PeriodicalId":165263,"journal":{"name":"Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control","volume":"80 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114013884","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}