Trading infinite memory for uniform randomness in timed games Conference Paper

Author(s): Chatterjee, Krishnendu; Henzinger, Thomas A; Prabhu, Vinayak S
Title: Trading infinite memory for uniform randomness in timed games
Title Series: LNCS
Abstract: We consider concurrent two-player timed automaton games with omega-regular objectives specified as parity conditions. These games offer an appropriate model for the synthesis of real-time controllers. Earlier works on timed games focused on pure strategies for each player. We study, for the first time, the use of randomized strategies in such games. While pure (i.e., nonrandomized) strategies in timed games require infinite memory for winning even with respect to reachability objectives, we show that randomized strategies can win with finite memory with respect to all parity objectives. Also, the synthesized randomized real-time controllers are much simpler in structure than the corresponding pure controllers, and therefore easier to implement. For safety objectives we prove the existence of pure finite-memory winning strategies. Finally, while randomization helps in simplifying the strategies required for winning timed parity games, we prove that randomization does not help in winning at more states.
Conference Title: HSCC: Hybrid Systems - Computation and Control
Volume: 4981
Conference Dates: April 22-24, 2008
Conference Location: St. Louis, MO, USA
Publisher: Springer  
Location: Berlin, Heidelberg
Date Published: 2008-04-03
Start Page: 87
End Page: 100
Sponsor: This research was supported in part by the NSF grants CCR-0208875, CCR-0225610, CCR-0234690, by the Swiss National Science Foundation, and by the Artist2 European Network of Excellence.
DOI: 10.1007/978-3-540-78929-1_7
Open access: no
IST Austria Authors
  1. Thomas A. Henzinger
    415 Henzinger
Related IST Austria Work