Computing bounded reach sets from sampled simulation traces

This paper presents an algorithm which uses simulation traces and formal models for computing overapproximations of reach sets of deterministic hybrid systems. The implementation of the algorithm in a tool, Hybrid Trace Verifier (HTV), uses Mathwork's Simulink/Stateflow (SLSF) environment for generating simulation traces and for obtaining formal models. Computation of the overapproximation relies on computing error bounds in the dynamics obtained from the formal model. Verification results from three case studies, namely, a version of the navigation benchmark, an engine control system, and a satellite system suggest that this combined formal analysis and simulation based approach may scale to larger problems.

[1]  Insup Lee,et al.  Robust Test Generation and Coverage for Hybrid Systems , 2007, HSCC.

[2]  Samuel Skulsky.  A Theory of Time , 1938, Philosophy of Science.

[3]  Sriram Sankaranarayanan,et al.  S-TaLiRo: A Tool for Temporal Logic Falsification for Hybrid Systems , 2011, TACAS.

[4]  Sayan Mitra,et al.  A verification framework for hybrid systems , 2007 .

[5]  George J. Pappas,et al.  Robustness of temporal logic specifications for continuous-time signals , 2009, Theor. Comput. Sci..

[6]  Sriram Sankaranarayanan,et al.  Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models , 2009, CAV.

[7]  Marco Caccamo,et al.  A step towards verification and synthesis from simulink/stateflow models , 2011, HSCC '11.

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

[9]  Karthikeyan Manamcheri Sukumar.  Translation of Simulink-Stateflow models to hybrid automata , 2011 .

[10]  Nancy A. Lynch,et al.  The Theory of Timed I/o Automata , 2003 .

[11]  Nancy A. Lynch,et al.  The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) , 2006 .

[12]  Ansgar Fehnker,et al.  Benchmarks for Hybrid Systems Verification , 2004, HSCC.

[13]  O. Bouissou,et al.  GRKLib: a Guaranteed Runge Kutta Library , 2006, 12th GAMM - IMACS International Symposium on Scientific Computing, Computer Arithmetic and Validated Numerics (SCAN 2006).

[14]  Panganamala Ramana Kumar,et al.  Bounded ∈-reachability of linear hybrid automata with a deterministic and transversal discrete transition condition , 2010, 49th IEEE Conference on Decision and Control (CDC).

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