Date of Original Version
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-10936-7_10
Abstract or Description
n this paper we seek to provide greater automation for formal deductive verification tools working with continuous and hybrid dynamical systems. We present an efficient procedure to check invariance of conjunctions of polynomial equalities under the flow of polynomial ordinary differential equations. The procedure is based on a necessary and sufficient condition that characterizes invariant conjunctions of polynomial equalities. We contrast this approach to an alternative one which combines fast and sufficient (but not necessary) conditions using differential cuts for soundly restricting the system evolution domain.
Lecture Notes in Computer Science, 8723, 151-167.