Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods

Aiming at automatic verification and analysis techniques for hybrid systems, we present a novel combination of enclosure methods for ordinary differential equations (ODEs) with the iSAT solver for large Boolean combinations of arithmetic constraints. Improving on our previous work, the contribution of this paper lies in combining iSAT with VNODE-LP, as a state-of-the-art enclosure method for ODEs, and with bracketing systems which exploit monotonicity properties to find enclosures for problems that VNODE-LP alone cannot enclose tightly. We apply our method to the analysis of a non-linear hybrid system by solving predicative encodings of an inductive stability argument and evaluate the impact of different methods and their combination.

[1]  N. Nedialkov,et al.  Computing rigorous bounds on the solution of an initial value problem for an ordinary differential equation , 1999 .

[2]  Kazunori Ueda,et al.  An interval-based SAT modulo ODE solver for model checking nonlinear hybrid systems , 2011, International Journal on Software Tools for Technology Transfer.

[3]  Alexandre Goldsztejn,et al.  Including Ordinary Differential Equations Based Constraints in the Standard CP Framework , 2010, CP.

[4]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[5]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[6]  Olaf Stursberg,et al.  Comparing Timed and Hybrid Automata as Approximations of Continuous Systems , 1996, Hybrid Systems.

[7]  Martin Fränzle,et al.  SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems , 2008, ATVA.

[8]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[9]  Eric Walter,et al.  GUARANTEED NONLINEAR PARAMETER ESTIMATION FOR CONTINUOUS-TIME DYNAMICAL MODELS , 2006 .

[10]  Nacim Meslem,et al.  A Hybrid Bounding Method for Computing an Over-Approximation for the Reachable Set of Uncertain Nonlinear Systems , 2009, IEEE Transactions on Automatic Control.

[11]  Ofer Shtrichman.  Tuning SAT Checkers for Bounded Model Checking , 2000, CAV 2000.

[12]  David Cohen,et al.  Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings , 2010, CP.

[13]  Nedialko S. Nedialkov,et al.  Implementing a Rigorous ODE Solver Through Literate Programming , 2011 .

[14]  Y. Candau,et al.  Computing reachable sets for uncertain nonlinear monotone systems , 2010 .

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

[16]  Martin Fränzle,et al.  Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure , 2007, J. Satisf. Boolean Model. Comput..

[17]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[18]  Nedialko S. Nedialkov,et al.  An Interval Hermite-Obreschkoff Method for Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation , 1998, SCAN.

[19]  Andreas Podelski,et al.  Region Stability Proofs for Hybrid Systems , 2007, FORMATS.

[20]  Max b. Müller.  Über das Fundamentaltheorem in der Theorie der gewöhnlichen Differentialgleichungen , 1927 .

[21]  Kazunori Ueda,et al.  Interval-based Solving of Hybrid Constraint Systems , 2009, ADHS.

[22]  Panos J. Antsaklis,et al.  Hybrid Systems IV , 1997, Lecture Notes in Computer Science.

[23]  Thomas A. Henzinger,et al.  Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods , 2000, HSCC.