{"abstract":[{"lang":"eng","text":"Games on graphs with ω-regular objectives provide a model for the control and synthesis of reactive systems. Every ω-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens “eventually.” Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (Büchi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett (fairness) objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound."}],"_id":"4539","date_published":"2006-03-15T00:00:00Z","conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"extern":1,"citation":{"ama":"Chatterjee K, Henzinger TA. Finitary winning in omega-regular games. In: Vol 3920. Springer; 2006:257-271. doi:<a href=\"https://doi.org/10.1007/11691372_17\">10.1007/11691372_17</a>","apa":"Chatterjee, K., &#38; Henzinger, T. A. (2006). Finitary winning in omega-regular games (Vol. 3920, pp. 257–271). Presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, Springer. <a href=\"https://doi.org/10.1007/11691372_17\">https://doi.org/10.1007/11691372_17</a>","ista":"Chatterjee K, Henzinger TA. 2006. Finitary winning in omega-regular games. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 3920, 257–271.","chicago":"Chatterjee, Krishnendu, and Thomas A Henzinger. “Finitary Winning in Omega-Regular Games,” 3920:257–71. Springer, 2006. <a href=\"https://doi.org/10.1007/11691372_17\">https://doi.org/10.1007/11691372_17</a>.","short":"K. Chatterjee, T.A. Henzinger, in:, Springer, 2006, pp. 257–271.","mla":"Chatterjee, Krishnendu, and Thomas A. Henzinger. <i>Finitary Winning in Omega-Regular Games</i>. Vol. 3920, Springer, 2006, pp. 257–71, doi:<a href=\"https://doi.org/10.1007/11691372_17\">10.1007/11691372_17</a>.","ieee":"K. Chatterjee and T. A. Henzinger, “Finitary winning in omega-regular games,” presented at the TACAS: Tools and Algorithms for the Construction and Analysis of Systems, 2006, vol. 3920, pp. 257–271."},"publication_status":"published","date_updated":"2021-01-12T07:59:32Z","month":"03","page":"257 - 271","doi":"10.1007/11691372_17","day":"15","author":[{"full_name":"Krishnendu Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"type":"conference","alternative_title":["LNCS"],"status":"public","acknowledgement":"This research was supported in part by the AFOSR MURI grant F49620-00-1-0327 and the NSF ITR grant CCR-0225610.","title":"Finitary winning in omega-regular games","quality_controlled":0,"publisher":"Springer","year":"2006","volume":3920,"date_created":"2018-12-11T12:09:22Z","publist_id":"183","intvolume":"      3920"}