Improving the SAT modulo ODE approach to hybrid systems analysis by combining different enclosure methods

Aiming at automatic verification and analysis techniques for hybrid discrete-continuous 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 interval solver for ODEs, and with bracketing systems, which exploit monotonicity properties allowing to find enclosures for problems that VNODE-LP alone cannot enclose tightly. We apply the combined iSAT-ODE solver to the analysis of a variety of non-linear hybrid systems by solving predicative encodings of reachability properties and of an inductive stability argument, and evaluate the impact of the different enclosure methods, decision heuristics and their combination. Our experiments include classic benchmarks from the literature, as well as a newly-designed conveyor belt system that combines hybrid behavior of parallel components, a slip-stick friction model with non-linear dynamics and flow invariants and several dimensions of parameterization. In the paper, we also present and evaluate an extension of VNODE-LP tailored to its use as a deduction mechanism within iSAT-ODE, to allow fast re-evaluations of enclosures over arbitrary subranges of the analyzed time span.

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

[2]  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.

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

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

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

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

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

[8]  Olaf Stursberg,et al.  Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement , 2003, TACAS.

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

[10]  Kaj Madsen,et al.  Automatic Validation of Numerical Solutions , 1997 .

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

[12]  Vincent Lefèvre,et al.  MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

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

[14]  Karl Henrik Johansson,et al.  Dynamical properties of hybrid automata , 2003, IEEE Trans. Autom. Control..

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

[16]  Ofer Strichman,et al.  Tuning SAT Checkers for Bounded Model Checking , 2000, CAV.

[17]  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.

[18]  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.

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

[20]  Nedialko S. Nedialkov,et al.  Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods , 2011, SEFM.

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

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

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

[24]  Walter Krämer,et al.  FILIB++, a fast interval library supporting containment computations , 2006, TOMS.