An invariant of a system is a predicate that holds for every reachable state. In this paper, we present techniques to generate invariants for hybrid systems. This is achieved by reducing the invariant generation problem to a constraint solving problem using methods from the theory of ideals over polynomial rings. We extend our previous work on the generation of algebraic invariants for discrete transition systems in order to generate algebraic invariants for hybrid systems. In doing so, we present a new technique to handle consecution across continuous differential equations. The techniques we present allow a trade-off between the complexity of the invariant generation process and the strength of the resulting invariants. © Springer-Verlag 2004.
CITATION STYLE
Sankaranarayanan, S., Sipma, H. B., & Manna, Z. (2004). Constructing invariants for hybrid systems. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 539–554. https://doi.org/10.1007/978-3-540-24743-2_36
Mendeley helps you to discover research relevant for your work.