Verified Reachability Analysis of Continuous Systems

Ordinary differential equations ODEs are often used to model the dynamics of often safety-critical continuous systems. This work presents the formal verification of an algorithm for reachability analysis in continuous systems. The algorithm features adaptive Runge-Kutta methods and rigorous numerics based on affine arithmetic. It is proved to be sound with respect to the existing formalization of ODEs in Isabelle/HOL. Optimizations like splitting, intersecting and collecting reachable sets are necessary to analyze chaotic systems. Experiments demonstrate the practical usability of our developments.

[1]  Jorge Stolfi,et al.  Affine Arithmetic: Concepts and Applications , 2004, Numerical Algorithms.

[2]  J. Hale,et al.  Ordinary Differential Equations , 2019, Fundamentals of Numerical Mathematics for Physicists and Engineers.

[3]  Martin Berz,et al.  Verified Integration of ODEs and Flows Using Differential Algebraic Methods on High-Order Taylor Models , 1998, Reliab. Comput..

[4]  Stanley Bak.  Reducing the wrapping effect in flowpipe construction using pseudo-invariants , 2014, CyPhy '14.

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

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

[7]  Nathalie Revol,et al.  A Validated Real Function Calculus , 2011, Math. Comput. Sci..

[8]  N. G. Parke,et al.  Ordinary Differential Equations. , 1958 .

[9]  Peter Lammich.  Refinement for Monadic Programs , 2012, Arch. Formal Proofs.

[10]  Fabian Immler,et al.  A Verified Algorithm for Geometric Zonotope/Hyperplane Intersection , 2015, CPP.

[11]  Matthias Althoff,et al.  Avoiding geometric intersection operations in reachability analysis of hybrid systems , 2012, HSCC '12.

[12]  Nicolas Brisebarre,et al.  Rigorous Polynomial Approximation Using Taylor Models in Coq , 2012, NASA Formal Methods.

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

[14]  André Platzer,et al.  The Complete Proof Theory of Hybrid Systems , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[15]  Bas Spitters,et al.  The Picard Algorithm for Ordinary Differential Equations in Coq , 2013, ITP.

[16]  Tiziano Villa,et al.  Ariadne: a framework for reachability analysis of hybrid automata , 2006 .

[17]  Xin Chen,et al.  Flow*: An Analyzer for Non-linear Hybrid Systems , 2013, CAV.

[18]  Guillaume Melquiond,et al.  Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Wave Equation Numerical Resolution: a Comprehensive Mechanized Proof of a C Program , 2022 .

[19]  Tobias Nipkow,et al.  A Proof Assistant for Higher-Order Logic , 2002 .

[20]  Johannes Hölzl,et al.  Numerical Analysis of Ordinary Differential Equations in Isabelle/HOL , 2012, ITP.

[21]  Alexandre Chapoutot,et al.  Enclosing Temporal Evolution of Dynamical Systems Using Numerical Methods , 2013, NASA Formal Methods.

[22]  Fabian Immler,et al.  Formally Verified Computation of Enclosures of Solutions of Ordinary Differential Equations , 2014, NASA Formal Methods.

[23]  Antoine Girard,et al.  SpaceEx: Scalable Verification of Hybrid Systems , 2011, CAV.

[24]  Matthias Althoff,et al.  Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets , 2013, HSCC '13.

[25]  Roland Zumkeller.  Formal Global Optimisation with Taylor Models , 2006, IJCAR.

[26]  Warwick Tucker,et al.  Foundations of Computational Mathematics a Rigorous Ode Solver and Smale's 14th Problem , 2022 .