English

Deductive Stability Proofs for Ordinary Differential Equations

Logic in Computer Science 2022-02-25 v4

Abstract

Stability is required for real world controlled systems as it ensures that those systems can tolerate small, real world perturbations around their desired operating states. This paper shows how stability for continuous systems modeled by ordinary differential equations (ODEs) can be formally verified in differential dynamic logic (dL). The key insight is to specify ODE stability by suitably nesting the dynamic modalities of dL with first-order logic quantifiers. Elucidating the logical structure of stability properties in this way has three key benefits: i) it provides a flexible means of formally specifying various stability properties of interest, ii) it yields rigorous proofs of those stability properties from dL's axioms with dL's ODE safety and liveness proof principles, and iii) it enables formal analysis of the relationships between various stability properties which, in turn, inform proofs of those properties. These benefits are put into practice through an implementation of stability proofs for several examples in KeYmaera X, a hybrid systems theorem prover based on dL.

Keywords

Cite

@article{arxiv.2010.13096,
  title  = {Deductive Stability Proofs for Ordinary Differential Equations},
  author = {Yong Kiam Tan and André Platzer},
  journal= {arXiv preprint arXiv:2010.13096},
  year   = {2022}
}

Comments

Long version of paper at TACAS 2021 (27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 27 Mar - 1 Apr 2021)

R2 v1 2026-06-23T19:37:47.154Z