{"publication_status":"published","type":"conference","doi":"10.1007/978-3-540-78929-1_7","publisher":"Springer Nature","date_published":"2008-04-03T00:00:00Z","article_processing_charge":"No","citation":{"chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Trading Infinite Memory for Uniform Randomness in Timed Games.” In 11th Workshop on Hybrid Systems: Computation and Control, 4981:87–100. Springer Nature, 2008. https://doi.org/10.1007/978-3-540-78929-1_7.","apa":"Chatterjee, K., Henzinger, T. A., & Prabhu, V. (2008). Trading infinite memory for uniform randomness in timed games. In 11th Workshop on Hybrid Systems: Computation and Control (Vol. 4981, pp. 87–100). St. Louis, MO, United States: Springer Nature. https://doi.org/10.1007/978-3-540-78929-1_7","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2008. Trading infinite memory for uniform randomness in timed games. 11th Workshop on Hybrid Systems: Computation and Control. HSCC: Hybrid Systems - Computation and Control, LNCS, vol. 4981, 87–100.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, 11th Workshop on Hybrid Systems: Computation and Control, Springer Nature, 2008, pp. 87–100.","mla":"Chatterjee, Krishnendu, et al. “Trading Infinite Memory for Uniform Randomness in Timed Games.” 11th Workshop on Hybrid Systems: Computation and Control, vol. 4981, Springer Nature, 2008, pp. 87–100, doi:10.1007/978-3-540-78929-1_7.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Trading infinite memory for uniform randomness in timed games. In: 11th Workshop on Hybrid Systems: Computation and Control. Vol 4981. Springer Nature; 2008:87-100. doi:10.1007/978-3-540-78929-1_7","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Trading infinite memory for uniform randomness in timed games,” in 11th Workshop on Hybrid Systems: Computation and Control, St. Louis, MO, United States, 2008, vol. 4981, pp. 87–100."},"abstract":[{"text":"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.","lang":"eng"}],"_id":"3874","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Prabhu","first_name":"Vinayak","full_name":"Prabhu, Vinayak"}],"date_created":"2018-12-11T12:05:38Z","alternative_title":["LNCS"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Trading infinite memory for uniform randomness in timed games","OA_type":"closed access","intvolume":" 4981","oa_version":"None","publication":"11th Workshop on Hybrid Systems: Computation and Control","publist_id":"2297","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"]},"day":"03","year":"2008","conference":{"end_date":"2008-04-24","name":"HSCC: Hybrid Systems - Computation and Control","start_date":"2008-04-22","location":"St. Louis, MO, United States"},"volume":4981,"date_updated":"2026-06-10T10:14:59Z","page":"87 - 100","acknowledgement":"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.","status":"public","extern":"1","month":"04"}