Sampling-Based Resolution-Complete Algorithms for Safety Falsification of Linear Systems

In this paper, we describe a novel approach for checking safety specifications of a dynamical system with exogenous inputs over infinite time horizon. We introduce the notion of resolution completeness for analysis of safety falsification algorithms and present sampling-based resolution-complete algorithms for safety falsification of discrete-time linear time-invariant systems. Given a target resolution of inputs, the algorithms terminate either with a reachable state that violates the safety specification, or prove that the system does not violate the specification at the given resolution of inputs.

[1]  Tarik Nahhal,et al.  Guided Randomized Simulation , 2007, HSCC.

[2]  Wolfgang Kuehn,et al.  Rigorously computed orbits of dynamical systems without the wrapping effect , 1998, Computing.

[3]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[4]  Rajeev Alur,et al.  Reachability Analysis of Hybrid Systems via Predicate Abstraction , 2002, HSCC.

[5]  Ken Goldberg,et al.  Completeness in robot motion planning , 1995 .

[6]  Pravin Varaiya,et al.  Ellipsoidal Techniques for Reachability Analysis , 2000, HSCC.

[7]  Antoine Girard.  Approximately Bisimilar Finite Abstractions of Stable Linear Systems , 2007, HSCC.

[8]  Olaf Stursberg,et al.  An assessment of the current status of algorithmic approaches to the verification of hybrid systems , 2001, Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228).

[9]  Thomas A. Henzinger,et al.  HYTECH: The Cornell HYbrid TECHnology Tool , 1994, Hybrid Systems.

[10]  Emilio Frazzoli,et al.  Sampling-based resolution-complete safety falsification of linear hybrid systems , 2007, 2007 46th IEEE Conference on Decision and Control.

[11]  M. Morari,et al.  A geometric algorithm for multi-parametric linear programming , 2003 .

[12]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[13]  Bruce H. Krogh,et al.  Verification of Polyhedral-Invariant Hybrid Automata Using Polygonal Flow Pipe Approximations , 1999, HSCC.

[14]  Ian M. Mitchell,et al.  Level Set Methods for Computation in Hybrid Systems , 2000, HSCC.

[15]  Vijay Kumar,et al.  An RRT-Based Algorithm for Testing and Validating Multi-Robot Controllers , 2005, Robotics: Science and Systems.

[16]  Vijay Kumar,et al.  Sampling-based Falsification and Verification of Controllers for Continuous Dynamic Systems , 2008, Int. J. Robotics Res..

[17]  Stefan Ratschan,et al.  Safety verification of hybrid systems by constraint propagation-based abstraction refinement , 2007, TECS.

[18]  Joseph Sifakis,et al.  Integration Graphs: A Class of Decidable Hybrid Systems , 1992, Hybrid Systems.

[19]  Eugene Asarin,et al.  The d/dt Tool for Verification of Hybrid Systems , 2002, CAV.

[20]  Oded Maler,et al.  Systematic Simulation Using Sensitivity Analysis , 2007, HSCC.

[21]  S. LaValle,et al.  Resolution completeness for sampling-based motion planning with difierential constraints , 2022 .

[22]  Ali Jadbabaie,et al.  Safety Verification of Hybrid Systems Using Barrier Certificates , 2004, HSCC.

[23]  Steven M. LaValle,et al.  Incremental Grid Sampling Strategies in Robotics , 2004, WAFR.

[24]  E. Frazzoli,et al.  Resolution-complete safety falsification of continuous time systems , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[25]  Vijay Kumar,et al.  Computational Techniques for Analysis of Genetic Network Dynamics , 2005, Int. J. Robotics Res..

[26]  Antoine Girard,et al.  Reachability of Uncertain Linear Systems Using Zonotopes , 2005, HSCC.

[27]  Emilio Frazzoli,et al.  Incremental Search Methods for Reachability Analysis of Continuous and Hybrid Systems , 2004, HSCC.