Title
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations.
Abstract
In 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.
Year
DOI
Venue
2014
10.1007/978-3-319-10936-7_10
Lecture Notes in Computer Science
Keywords
Field
DocType
reasoning,polynomials,differential equations,set theory,efficiency,dynamics,hybrid systems,lie groups,logic,automation,verification,computations,behavior,invariance
Differential equation,Algebraic number,Polynomial,Ordinary differential equation,Algebra,Computer science,Algebraic differential equation,Differential algebraic geometry,Theoretical computer science,Dynamical systems theory,Invariant (mathematics)
Conference
Volume
ISSN
Citations 
8723
0302-9743
3
PageRank 
References 
Authors
0.39
17
3
Name
Order
Citations
PageRank
Khalil Ghorbal1425.34
Andrew Sogokon2196.16
André Platzer3142582.57