Constructing Invariants for Hybrid SystemsSriram Sankaranarayanan , Henny Sipma, Zohar Manna |
|
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 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.
|
|
postscript
pdf
|
| © 2003, Springer Verlag |
| Hybrid Systems: Computation and Control (HSCC 2004), to appear |