Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets
From MaRDI portal
Publication:3543289
DOI10.1007/978-3-540-85778-5_6zbMath1171.68523MaRDI QIDQ3543289
Michał Rutkowski, Ranko Lazić, Marcin Jurdziński, Patricia Bouyer, Thomas Brihaye
Publication date: 2 December 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_6
68Q45: Formal languages and automata
Related Items
Unnamed Item, Formal language properties of hybrid systems with strong resets, A game-theoretic approach to fault diagnosis and identification of hybrid systems, Interrupt timed automata: verification and expressiveness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- A survey on real structural complexity theory
- A theory of timed automata
- O-minimal hybrid systems.
- On the expressiveness and decidability of o-minimal hybrid systems
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- Hybrid Systems: Computation and Control
- Reachability-Time Games on Timed Automata
- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
- A note on the undecidability of the reachability problem for o-minimal dynamical systems
- Formal Modeling and Analysis of Timed Systems
- Formal Modeling and Analysis of Timed Systems