Trading Infinite Memory for Uniform Randomness in Timed Games

DOI10.1007/978-3-540-78929-1_7zbMath1143.68479OpenAlexW1499620300MaRDI QIDQ3523100

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

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

Related Items (3)

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

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