A Method for Invariant Generation for Polynomial Continuous Systems

Abstract : This paper presents a method for generating semi-algebraic invariants for systems governed by non-linear polynomial ordinary differential equations under semi-algebraic evolution constraints. Based on the notion of discrete abstraction , our method eliminates unsoundness and unnecessary coarseness found in existing approaches for computing abstractions for non-linear continuous systems and is able to construct invariants with intricate boolean structure, in contrast to invariants typically generated using template-based methods. In order to tackle the state explosion problem associated with discrete abstraction, we present invariant generation algorithms that exploit sound proof rules for safety verification , such as differential cut (DC), and a new proof rule that we call differential divide-and-conquer (DDC), which splits the verification problem into smaller sub-problems. The resulting invariant generation method is observed to be much more scalable and efficient than the na¨ıvena¨ıve approach, exhibiting orders of magnitude performance improvement on many of the problems.
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

Contributor : Khalil Ghorbal <>
Submitted on : Monday, October 3, 2016 - 9:21:22 AM
Last modification on : Thursday, February 7, 2019 - 2:48:40 PM
Long-term archiving on : Wednesday, January 4, 2017 - 12:46:23 PM


Files produced by the author(s)





Andrew Sogokon, Khalil Ghorbal, Paul Jackson, André Platzer. A Method for Invariant Generation for Polynomial Continuous Systems. VMCAI 2016 - 17th International Conference on Verification, Model Checking, and Abstract Interpretation, Jan 2016, St. Petersburg, Florida, United States. pp.268-288, ⟨10.1007/978-3-662-49122-5_13⟩. ⟨hal-01374902⟩



Record views


Files downloads