Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Competitive Markov decision processes
Competitive Markov decision processes
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Introduction to Hybrid Dynamical Systems
Introduction to Hybrid Dynamical Systems
Minimum-Cost Reachability for Priced Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
Optimal Paths in Weighted Timed Automata
HSCC '01 Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Control in o-minimal Hybrid Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability problems on extended o-minimal hybrid automata
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Reachability-time games on timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Interrupt Timed Automata: verification and expressiveness
Formal Methods in System Design
Supervisor synthesis for controller upgrades
Proceedings of the Conference on Design, Automation and Test in Europe
A game-theoretic approach to fault diagnosis and identification of hybrid systems
Theoretical Computer Science
| Hi-index | 0.00 |
We introduce and study hybrid automata with strong resets. They generalize o-minimal hybrid automata, a class of hybrid automata which allows modeling of complex continuous dynamics. A number of analysis problems, such as reachability testing and controller synthesis, are decidable for classes of o-minimal hybrid automata. We generalize existing decidability results for controller synthesis on hybrid automata and we establish new ones by proving that average-price and reachability-price games on hybrid systems with strong resets are decidable, provided that the structure on which the hybrid automaton is defined has a decidable first-order theory. Our proof techniques include a novel characterization of values in games on hybrid systems by optimality equations, and a definition of a new finitary equivalence relation on the states of a hybrid system which enables a reduction of games on hybrid systems to games on finite graphs.