What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Symbolic analysis for improving simulation coverage of Simulink/Stateflow models
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Theoretical Computer Science
Reachability for linear hybrid automata using iterative relaxation abstraction
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Robust test generation and coverage for hybrid systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Behavioral cartography of timed automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Synthesis of timing parameters satisfying safety properties
RP'11 Proceedings of the 5th international conference on Reachability problems
| Hi-index | 0.00 |
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.