Recent progress in continuous and hybrid reachability analysis

Set-based reachability analysis computes all possible states a system may attain, and in this sense provides knowledge about the system with a completeness, or coverage, that a finite number of simulation runs can not deliver. Due to its inherent complexity, the application of reachability analysis has been limited so far to simple systems, both in the continuous and the hybrid domain. In this paper we present recent advances that, in combination, significantly improve this applicability, and allow us to find better balance between computational cost and accuracy. The presentation covers, in a unified manner, a variety of methods handling increasingly complex types of continuous dynamics (constant derivative, linear, nonlinear). The improvements include new geometrical objects for representing sets, new approximation schemes, and more flexible combinations of graph-search algorithm and partition refinement. We report briefly some preliminary experiments that have enabled the analysis of systems previously beyond reach.

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

[2]  Thao Dang.  Approximate Reachability Computation for Polynomial Systems , 2006, HSCC.

[3]  Stavros Tripakis,et al.  Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations , 2000, HSCC.

[4]  Oded Maler,et al.  Reachability Analysis via Face Lifting , 1998, HSCC.

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

[6]  David L. Dill,et al.  Verification by approximate forward and backward reachability , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[7]  Pravin Varaiya,et al.  Reach Set Computation Using Optimal Control , 2000 .

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

[9]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

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

[11]  Bruce H. Krogh,et al.  Computational techniques for hybrid system verification , 2003, IEEE Trans. Autom. Control..

[12]  Olivier Bournez,et al.  Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems , 2000, HSCC.

[13]  Rob A. Rutenbar,et al.  Verifying analog oscillator circuits using forward/backward abstraction refinement , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[14]  Gerardo Lafferriere,et al.  Symbolic Reachability Computation for Families of Linear Vector Fields , 2001, J. Symb. Comput..

[15]  P. Varaiya,et al.  Ellipsoidal techniques for reachability analysis: internal approximation , 2000 .

[16]  Roberto Bagnara,et al.  Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library , 2002, SAS.

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

[18]  Thomas A. Henzinger,et al.  HYTECH: a model checker for hybrid systems , 1997, International Journal on Software Tools for Technology Transfer.

[19]  Alexandre M. Bayen,et al.  Computational techniques for the verification of hybrid systems , 2003, Proc. IEEE.

[20]  Goran Frehse.  PHAVer: Algorithmic Verification of Hybrid Systems Past HyTech , 2005, HSCC.

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

[22]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[23]  Antoine Girard,et al.  Verification Using Simulation , 2006, HSCC.

[24]  Ashish Tiwari.  Approximate Reachability for Linear Systems , 2003, HSCC.

[25]  Olaf Stursberg,et al.  Efficient Representation and Computation of Reachable Sets for Hybrid Systems , 2003, HSCC.

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

[27]  Thomas A. Henzinger,et al.  Automatic Rectangular Refinement of Affine Hybrid Systems , 2005, FORMATS.

[28]  David L. Dill,et al.  Verification by approximate forward and backward reachability , 1998, ICCAD '98.

[29]  Stefan Ratschan,et al.  Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement , 2005, HSCC.

[30]  Thomas A. Henzinger,et al.  Automatic Symbolic Verification of Embedded Systems , 1996, IEEE Trans. Software Eng..

[31]  T. Henzinger,et al.  Algorithmic Analysis of Nonlinear Hybrid Systems , 1998, CAV.

[32]  Alexandre M. Bayen,et al.  Computational Techniques for the Verification and Control of Hybrid Systems , 2005 .

[33]  Antoine Girard,et al.  Reachability Analysis of Nonlinear Systems Using Conservative Approximation , 2003, HSCC.

[34]  Antoine Girard,et al.  Efficient Computation of Reachable Sets of Linear Time-Invariant Systems with Inputs , 2006, HSCC.

[35]  Bruce H. Krogh,et al.  Reachability Analysis of Large-Scale Affine Systems Using Low-Dimensional Polytopes , 2006, HSCC.