Abstract
Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a set of parameter valuations which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics. The method is demonstrated with a hybrid system benchmark from the literature.
| Original language | English |
|---|---|
| Pages (from-to) | 233-249 |
| Number of pages | 17 |
| Journal | International Journal of Foundations of Computer Science |
| Volume | 24 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Feb 2013 |
| Externally published | Yes |
Keywords
- Hybrid systems
- hybrid automata
- inverse method
- parameter synthesis