Trading Infinite Memory for Uniform Randomness in Timed Games

DOI10.1007/978-3-540-78929-1_7MaRDI QIDQ3523100zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Vinayak S. Prabhu, Thomas A. Henzinger

Publication date 2 September 2008

Published in Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-78929-1_7

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Applications of game theory (91A80) Synthesis problems (93B50)

Recommendations

• Timed Parity Games: Complexity and Robustness
• Timed Parity Games: Complexity and Robustness
• Stochastic Real-Time Games with Qualitative Timed Automata Objectives
• Synthesis of memory-efficient ``real-time controllers for safety objectives
• Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems

Cited in

(11)

• A Caching Game with Infinitely Divisible Hidden Material
• Synthesis of memory-efficient ``real-time controllers for safety objectives
• Strict Divergence for Probabilistic Timed Automata
• Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
• Reaching Your Goal Optimally by Playing at Random with No Memory
• Timed Parity Games: Complexity and Robustness
• The element of surprise in timed games.
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
• Playing stochastically in weighted timed games to emulate memory
• Playing stochastically in weighted timed games to emulate memory
• Simplicity lies in the eye of the beholder: a strategic perspective on controllers in reactive synthesis

This page was built for publication: Trading Infinite Memory for Uniform Randomness in Timed Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523100)