TY - GEN
T1 - Parametric verification and test coverage for hybrid automata using the inverse method
AU - Fribourg, Laurent
AU - Kühne, Ulrich
PY - 2011/10/4
Y1 - 2011/10/4
N2 - 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.
AB - 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.
U2 - 10.1007/978-3-642-24288-5_17
DO - 10.1007/978-3-642-24288-5_17
M3 - Conference contribution
AN - SCOPUS:80053339222
SN - 9783642242878
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 191
EP - 204
BT - Reachability Problems - 5th International Workshop, RP 2011, Proceedings
T2 - 5th International Workshop on Reachability Problems, RP 2011
Y2 - 28 September 2011 through 30 September 2011
ER -