Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
From MaRDI portal
Publication:388224
DOI10.1016/j.ic.2013.04.003zbMath1358.68164OpenAlexW2007709036MaRDI QIDQ388224
Vinayak S. Prabhu, Krishnendu Chatterjee
Publication date: 19 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.04.003
Applications of game theory (91A80) Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Liveness in timed and untimed systems
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- A theory of timed automata
- Discrete-time control for rectangular hybrid automata
- Synthesis of memory-efficient "real-time" controllers for safety objectives
- Timed Alternating-Time Temporal Logic
- Trading Infinite Memory for Uniform Randomness in Timed Games
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Efficient On-the-Fly Emptiness Check for Timed Büchi Automata
- Hybrid Systems: Computation and Control
- Reachability-Time Games on Timed Automata
- Timed Parity Games: Complexity and Robustness
- CONCUR 2005 – Concurrency Theory
- Timed Parity Games: Complexity and Robustness
- CONCUR 2003 - Concurrency Theory
- Computer Aided Verification
- Modularity for timed and hybrid systems