An Axiomatic Approach to Existence and Liveness for Differential Equations

This article presents an axiomatic approach for deductive verification of existence and liveness for ordinary differential equations (ODEs) with differential dynamic logic (dL). The approach yields proofs that the solution of a given ODE exists long enough to reach a given target region without leaving a given evolution domain. Numerous subtleties complicate the generalization of discrete liveness verification techniques, such as loop variants, to the continuous setting. For example, ODE solutions may blow up in finite time or their progress towards the goal may converge to zero. These subtleties are handled in dL by successively refining ODE liveness properties using ODE invariance properties which have a complete axiomatization. This approach is widely applicable: several liveness arguments from the literature are surveyed and derived as special instances of axiomatic refinement in dL. These derivations also correct several soundness errors in the surveyed literature, which further highlights the subtlety of ODE liveness reasoning and the utility of an axiomatic approach. An important special case of this approach deduces (global) existence properties of ODEs, which are a fundamental part of every ODE liveness argument. Thus, all generalizations of existence properties and their proofs immediately lead to corresponding generalizations of ODE liveness arguments. Overall, the resulting library of common refinement steps enables both the sound development and justification of new ODE existence and of liveness proof rules from dL axioms. These insights are put into practice through an implementation of ODE liveness proofs in the KeYmaera X theorem prover for hybrid systems.

[1]  Stefan Mitsch,et al.  A Formal Safety Net for Waypoint-Following in Ground Robots , 2019, IEEE Robotics and Automation Letters.

[2]  Stefan Ratschan,et al.  Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions , 2010, SIAM J. Control. Optim..

[3]  André Platzer,et al.  Differential Refinement Logic* , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[4]  W. Rudin Principles of mathematical analysis , 1964 .

[5]  André Platzer,et al.  An Axiomatic Approach to Liveness for Differential Equations , 2019, FM.

[6]  T. Henzinger The theory of hybrid automata , 1996, LICS 1996.

[7]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[8]  André Platzer,et al.  Logical Foundations of Cyber-Physical Systems , 2018, Springer International Publishing.

[9]  André Platzer,et al.  Differential Hybrid Games , 2015, ACM Trans. Comput. Log..

[10]  Anders Rantzer,et al.  Primal-Dual Tests for Safety and Reachability , 2005, HSCC.

[11]  André Platzer,et al.  Characterizing Algebraic Invariants by Differential Radical Invariants , 2014, TACAS.

[12]  Yong Kiam Tan,et al.  Differential Equation Invariance Axiomatization , 2019, J. ACM.

[13]  Daniel S. Graça,et al.  Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs , 2008, CCA.

[14]  W. Haddad,et al.  Nonlinear Dynamical Systems and Control: A Lyapunov-Based Approach , 2008 .

[15]  L. Pontryagin,et al.  Ordinary differential equations , 1964 .

[16]  S. Sastry,et al.  Zeno hybrid systems , 2001 .

[17]  Maria Domenica Di Benedetto,et al.  Understanding deadlock and livelock behaviors in Hybrid Control Systems , 2009 .

[18]  P. Hartman Ordinary Differential Equations , 1965 .

[19]  Nathan Fulton,et al.  KeYmaera X: An Axiomatic Tactical Theorem Prover for Hybrid Systems , 2015, CADE.

[20]  André Platzer,et al.  Logics of Dynamical Systems , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[21]  Dexter Kozen,et al.  Kleene algebra with tests , 1997, TOPL.

[22]  Paul B. Jackson,et al.  Direct Formal Verification of Liveness Properties in Continuous and Hybrid Dynamical Systems , 2015, FM.

[23]  Ashish Tiwari,et al.  Switching logic synthesis for reachability , 2010, EMSOFT '10.

[24]  Anders Rantzer,et al.  Convex Programs for Temporal Verification of Nonlinear Dynamical Systems , 2007, SIAM J. Control. Optim..

[25]  P. Olver Nonlinear Systems , 2013 .

[26]  Daniel S. Graça,et al.  Computability with polynomial differential equations , 2008, Adv. Appl. Math..

[27]  C. Chicone Ordinary Differential Equations with Applications , 1999, Texts in Applied Mathematics.

[28]  Naijun Zhan,et al.  Computing semi-algebraic invariants for polynomial dynamical systems , 2011, 2011 Proceedings of the Ninth ACM International Conference on Embedded Software (EMSOFT).

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

[30]  Taylor T. Johnson,et al.  Verifying Safety and Persistence in Hybrid Systems Using Flowpipes and Continuous Invariants , 2018, Journal of Automated Reasoning.

[31]  Nathan Fulton,et al.  Bellerophon: Tactical Theorem Proving for Hybrid Systems , 2017, ITP.

[32]  George J. Pappas,et al.  A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates , 2007, IEEE Transactions on Automatic Control.

[33]  Emil Sekerinski,et al.  From Action Systems to Distributed Systems - The Refinement Approach , 2016 .

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

[35]  André Platzer,et al.  A Complete Uniform Substitution Calculus for Differential Dynamic Logic , 2016, Journal of Automated Reasoning.

[36]  Andreas Podelski,et al.  Model Checking of Hybrid Systems: From Reachability Towards Stability , 2006, HSCC.

[37]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[38]  Leslie Lamport,et al.  Proving Liveness Properties of Concurrent Programs , 1982, TOPL.

[39]  Mandy Eberhart,et al.  Ordinary Differential Equations With Applications , 2016 .

[40]  A. Papachristodoulou,et al.  On the construction of Lyapunov functions using the sum of squares decomposition , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[41]  André Platzer,et al.  Differential-algebraic Dynamic Logic for Differential-algebraic Programs , 2010, J. Log. Comput..

[42]  Marc Pantel,et al.  Handling Refinement of Continuous Behaviors: A Proof Based Approach with Event-B , 2019, 2019 International Symposium on Theoretical Aspects of Software Engineering (TASE).

[43]  Eric Goubault,et al.  Forward Inner-Approximated Reachability of Non-Linear Continuous Systems , 2017, HSCC.

[44]  Georg Struth,et al.  Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL , 2019, RAMiCS.

[45]  Kaisa Sere,et al.  Hybrid action systems , 2003, Theor. Comput. Sci..

[46]  Sayan Mitra,et al.  Lyapunov abstractions for inevitability of hybrid systems , 2012, HSCC '12.

[47]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[48]  George J. Pappas,et al.  Verification of Hybrid Systems , 2018, Handbook of Model Checking.

[49]  Michael J. Butler,et al.  Modelling and Refining Hybrid Systems in Event-B and Rodin , 2016, From Action Systems to Distributed Systems.

[50]  V. P. Franklin,et al.  Introduction , 2018, The Journal of African American History.

[51]  Liang Zou,et al.  An Improved HHL Prover: An Interactive Theorem Prover for Hybrid Systems , 2015, ICFEM.

[52]  Rajeev Alur,et al.  Principles of Cyber-Physical Systems , 2015 .

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

[54]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[55]  André Platzer,et al.  KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description) , 2008, IJCAR.

[56]  Andrew Sogokon,et al.  Direct methods for deductive verification of temporal properties in continuous dynamical systems , 2016 .

[57]  André Platzer,et al.  dLι: Definite Descriptions in Differential Dynamic Logic , 2019, CADE.