Analysis of hybrid systems: An ounce of realism can save an infinity of states |
|
| Abstract | Hybrid automata have been introduced in both control engineering and computer science as a formal model for the dynamics of hybrid discrete-continuous systems. In the case of so-called linear hybrid automata this formalization supports semi-decision procedures for state reachability, yet no decision procedures due to inherent undecidability. Thus, unlike finite or timed automata, already linear hybrid automata are out-of-scope of fully automatic verification.
In this article, we devise a new semi-decision method for safety of linear and polynomial hybrid systems which may only fail on pathological, practically uninteresting cases. These remaining cases are such that their safety depends on the complete absence of noise, a situation unlikely to occur in real hybrid systems. Furthermore, we show that if low probability effects of noise are ignored akin to the way they are suppressed in digital modelling then safety becomes fully decidable. |
| Keywords | Hybrid Systems, Verification, Decision Procedures |
| Type | Conference paper [With referee] |
| Conference | Computer Science Logic (CSL'99) |
| Editors | J. Flum and M. Rodriguez-Artalejo |
| Year | 1999 Vol. 1683 pp. 126-140 |
| Publisher | Springer Verlag |
| Series | Lecture Notes in Computer Science |
| Electronic version(s) | [ps] |
| Publication link | http://www.imm.dtu.dk/~mf/CSL99.ps.Z |
| BibTeX data | [bibtex] |
| IMM Group(s) | Computer Science & Engineering |