Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
Journal of Computer and System Sciences
The Impressive Power of Stopwatches
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Robust Undecidability of Timed and Hybrid Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Using HyTech to Synthesize Control Parameters for a Steam Boiler
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
PHAVer: algorithmic verification of hybrid systems past HyTech
International Journal on Software Tools for Technology Transfer (STTT)
Automatic Synthesis of Robust and Optimal Controllers --- An Industrial Case Study
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Accurate hybridization of nonlinear systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
On reachability for hybrid automata over bounded time
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Automatic rectangular refinement of affine hybrid systems
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
The reachability problem for hybrid automata is undecidable, even for linear hybrid automata. This negative result has triggered several research lines, leading among others to: - the definition of subclasses of hybrid automata with a decidable reachability problem; - the definition of semi-algorithms that are useful in practice to attack the reachability problem; - the definition of variants of the reachability problem that are decidable for larger classes of hybrid automata. In this talk, we summarize classical and more recent results about those three research lines.