Delta-Complete Analysis for Bounded Reachability of Hybrid Systems

Abstract : We present the framework of delta-complete analysis for bounded reachability problems of general hybrid systems. We perform bounded reachability checking through solving delta-decision problems over the reals. The techniques take into account of robustness properties of the systems under numerical perturbations. We prove that the verification problems become much more mathematically tractable in this new framework. Our implementation of the techniques, an open-source tool dReach, scales well on several highly nonlinear hybrid system models that arise in biomedical and robotics applications.

[1]  Zhenqi Huang,et al.  Computing bounded reach sets from sampled simulation traces , 2012, HSCC '12.

[2]  Xin Chen,et al.  Taylor Model Flowpipe Construction for Non-linear Hybrid Systems , 2012, 2012 IEEE 33rd Real-Time Systems Symposium.

[3]  Jennifer M. Davoren.  Epsilon-Tubes and Generalized Skorokhod Metrics for Hybrid Paths Spaces , 2009, HSCC.

[4]  Sumit Gulwani,et al.  Constraint-Based Approach for Analysis of Hybrid Systems , 2008, CAV.

[5]  Martin Fränzle,et al.  Analysis of Hybrid Systems Using HySAT , 2008, Third International Conference on Systems (icons 2008).

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[8]  Roberto Bruttomesso,et al.  The OpenSMT Solver , 2010, TACAS.

[9]  Alessandro Cimatti,et al.  A quantifier-free SMT encoding of non-linear hybrid automata , 2012, 2012 Formal Methods in Computer-Aided Design (FMCAD).

[10]  Stefan Ratschan.  Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable , 2010, TAMC.

[11]  Rajeev Alur,et al.  Formal verification of hybrid systems , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

[12]  Marco Bozzano,et al.  Verifying Industrial Hybrid Systems with MathSAT , 2005, BMC@CAV.

[13]  Frédéric Benhamou,et al.  Algorithm 852: RealPaver: an interval solver using constraint satisfaction techniques , 2006, TOMS.

[14]  Edmund M. Clarke,et al.  Delta-Decidability over the Reals , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[15]  Edmund M. Clarke,et al.  Parameter Identification Using δ-Decisions for Biological Hybrid Systems , 2014 .

[16]  Edmund M. Clarke,et al.  δ-Complete Decision Procedures for Satisfiability over the Reals , 2012, IJCAR.

[17]  Thomas A. Henzinger,et al.  Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems , 1992, Hybrid Systems.

[18]  Martin Fränzle,et al.  Analysis of Hybrid Systems: An Ounce of Realism Can Save an Infinity of States , 1999, CSL.

[19]  Thomas A. Henzinger,et al.  Robust Undecidability of Timed and Hybrid Systems , 2000, HSCC.

[20]  Martin Fränzle,et al.  Engineering constraint solvers for automatic analysis of probabilistic hybrid automata , 2010, J. Log. Algebraic Methods Program..

[21]  Ezio Bartocci,et al.  From Cardiac Cells to Genetic Regulatory Networks , 2011, CAV.

[22]  Edmund M. Clarke,et al.  dReal: An SMT Solver for Nonlinear Theories over the Reals , 2013, CADE.

[23]  Mahesh Viswanathan,et al.  Verifying Tolerant Systems Using Polynomial Approximations , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[24]  Edmund M. Clarke,et al.  Satisfiability modulo ODEs , 2013, 2013 Formal Methods in Computer-Aided Design.

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