Access the full text.
Sign up today, get DeepDyve free for 14 days.
E. Emerson, C. Jutla (1991)
Tree automata, mu-calculus and determinacy[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
B. Alpern, F. Schneider (1984)
Defining LivenessInf. Process. Lett., 21
J. Neumann, Andrzej Szepietowski, I. Walukiewicz (2002)
Complexity of weak acceptance conditions in tree automataInf. Process. Lett., 84
Z. Manna, A. Pnueli (1991)
The Temporal Logic of Reactive and Concurrent Systems
R. Alur, T. Henzinger (1998)
Finitary fairnessProceedings Ninth Annual IEEE Symposium on Logic in Computer Science
Christof Löding, W. Thomas (2000)
Alternating Automata and Logics over Infinite Words
N. Dershowitz, D. Jayasimha, Seungjoon Park (2003)
Bounded Fairness
Stefan Dziembowski, M. Jurdzinski, I. Walukiewicz (1997)
How much memory is needed to win infinite games?Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science
K. Chatterjee, T. Henzinger (2006)
Finitary Winning in omega-Regular Games
K. Chatterjee (2008)
Linear Time Algorithm for Weak Parity GamesArXiv, abs/0805.1391
N. Dershowitz (2004)
Verification: Theory and Practice, 2772
R. Alur, T. Henzinger, O. Kupferman (1997)
Alternating-time temporal logicProceedings 38th Annual Symposium on Foundations of Computer Science
M. Jurdzinski, M. Paterson, Uri Zwick (2006)
A deterministic subexponential algorithm for solving parity gamesSIAM J. Comput., 38
N. Wallmeier, Patrick Hütten, W. Thomas (2003)
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
(2007)
Received April
Florian Horn (2007)
Faster Algorithms for Finitary Games
Florian Horn (2005)
Streett Games on Finite Graphs
(2007)
Article 1, Publication date
W. Thomas (1997)
Languages, Automata, and Logic
E. Emerson, C. Jutla (1988)
The complexity of tree automata and logics of programs[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
K. Chatterjee, Thomas Henzingerl (2006)
Finitary winning in w-regular gamesLecture Notes in Computer Science
A. Pnueli, Roni Rosner (1989)
On the synthesis of a reactive module
(1975)
Borel determinacy. Ann. Math
Y. Gurevich, L. Harrington (1982)
Trees, automata, and games
M. Jurdzinski (2000)
Small Progress Measures for Solving Parity Games
P. Ramadge, W. Wonham (1987)
Supervisory control of a class of discrete event processesSiam Journal on Control and Optimization, 25
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 objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Oct 1, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.