skip to main content
research-article

Finitary winning in ω-regular games

Published: 06 November 2009 Publication History

Abstract

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.

References

[1]
Alpern, B. and Schneider, F. 1985. Defining liveness. Inform. Process. Lett. 21, 181--185.
[2]
Alur, R. and Henzinger, T. 1994. Finitary fairness. In Proceedings of Logic in Computer Science. IEEE Computer Society, 52--61.
[3]
Alur, R., Henzinger, T., and Kupferman, O. 2002. Alternating-Time temporal logic. J. ACM 49, 672--713.
[4]
Chatterjee, K. 2006. Linear time algorithm for weak parity games. Tech. rep. UCB/EECS-2006-153. University of California at Berkeley.
[5]
Chatterjee, K. and Henzinger, T. 2006. Finitary winning in ω-regular games. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 3920. Springer, 257--271.
[6]
Dershowitz, N., Jayasimha, D., and Park, S. 2003. Bounded fairness. In Verification: Theory and Practice. Lecture Notes in Computer Science, vol. 2772. Springer, 304--317.
[7]
Dziembowski, S., Jurdziński, M., and Walukiewicz, I. 1997. How much memory is needed to win infinite games? In Proceedings of Logic in Computer Science. IEEE Computer Society, 99--110.
[8]
Emerson, E. and Jutla, C. 1988. The complexity of tree automata and logics of programs. In Proceedings of the conference on Foundations of Computer Science. IEEE Computer Society, 328--337.
[9]
Emerson, E. and Jutla, C. 1991. Tree automata, mu-calculus and determinacy. In Proceedings of the conference on Foundations of Computer Science. IEEE Computer Society, 368--377.
[10]
Gurevich, Y. and Harrington, L. 1982. Trees, automata, and games. In Proceedings of the Symposium on Theory of Computing. ACM, 60--65.
[11]
Horn, F. 2005. Streett games on finite graphs. In Proceedings of the Workshop on Games in Design and Verification.
[12]
Horn, F. 2007. Faster algorithms for finitary games. In Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 4424. Springer, 472--484.
[13]
Jurdziński, M. 2000. Small progress measures for solving parity games. In Proceedings of the Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1770, Springer, 290--301.
[14]
Jurdziński, M., Paterson, M., and Zwick, U. 2006. A deterministic subexponential algorithm for solving parity games. In Proceedings of the Symposium on Discrete Algorithms. ACM/SIAM, 117--123.
[15]
Löding, C. and Thomas, W. 2000. Alternating automata and logics over infinite words. In Proceedings of the IFIP International Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 1872. Springer, 521--535.
[16]
Manna, Z. and Pnueli, A. 1992. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer.
[17]
Martin, D. 1975. Borel determinacy. Ann. Math. 102, 363--371.
[18]
Neumann, J., Szepietowski, A., and Walukiewicz, I. 2002. Complexity of weak acceptance conditions in tree automata. Inform. Process. Lett. 84, 181--187.
[19]
Pnueli, A. and Rosner, R. 1989. On the synthesis of a reactive module. In Proceedings of the Conference on Principles of Programming Languages. ACM, 179--190.
[20]
Ramadge, P. and Wonham, W. 1987. Supervisory control of a class of discrete-event processes. SIAM J. Control Optimiz. 25, 206--230.
[21]
Thomas, W. 1997. Languages, automata, and logic. Handbook Formal Lang. 3, 389--455.
[22]
Wallmeier, N., Hutten, P., and Thomas, W. 2003. Symbolic synthesis of finite-state controllers for request-response specifications. In Proceedings of the Conference on Implementation and Application of Automata. Lecture Notes in Computer Science, vol. 2759. Springer, 11--22.

Cited By

View all
  • (2024)Stochastic Window Mean-Payoff GamesFoundations of Software Science and Computation Structures10.1007/978-3-031-57228-9_3(34-54)Online publication date: 5-Apr-2024
  • (2022)Timed Games with Bounded Window Parity ObjectivesFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-15839-1_10(165-182)Online publication date: 29-Aug-2022
  • (2021)Game-theoretic semantics for ATL+ with applications to model checkingInformation and Computation10.1016/j.ic.2020.104554276(104554)Online publication date: Feb-2021
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic
ACM Transactions on Computational Logic  Volume 11, Issue 1
October 2009
270 pages
ISSN:1529-3785
EISSN:1557-945X
DOI:10.1145/1614431
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 November 2009
Accepted: 01 July 2008
Received: 01 April 2007
Published in TOCL Volume 11, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. ω-regular objectives
  2. Model checking
  3. finitary objectives
  4. games on graphs

Qualifiers

  • Research-article
  • Research
  • Refereed

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)10
  • Downloads (Last 6 weeks)0
Reflects downloads up to 18 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Stochastic Window Mean-Payoff GamesFoundations of Software Science and Computation Structures10.1007/978-3-031-57228-9_3(34-54)Online publication date: 5-Apr-2024
  • (2022)Timed Games with Bounded Window Parity ObjectivesFormal Modeling and Analysis of Timed Systems10.1007/978-3-031-15839-1_10(165-182)Online publication date: 29-Aug-2022
  • (2021)Game-theoretic semantics for ATL+ with applications to model checkingInformation and Computation10.1016/j.ic.2020.104554276(104554)Online publication date: Feb-2021
  • (2020)Optimal Strategies in Weighted Limit GamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.326.8326(114-130)Online publication date: 20-Sep-2020
  • (2020)Hierarchical cost-parity gamesTheoretical Computer Science10.1016/j.tcs.2020.10.002847(147-174)Online publication date: Dec-2020
  • (2020)Quantitative reductions and vertex-ranked infinite gamesInformation and Computation10.1016/j.ic.2020.104596(104596)Online publication date: Jun-2020
  • (2019)Optimal Path Planning for ω-regular Objectives with Abstraction-Refinement2019 International Conference on Robotics and Automation (ICRA)10.1109/ICRA.2019.8794209(7683-7689)Online publication date: 20-May-2019
  • (2019)Alternating-time temporal logic ATL with finitely bounded semanticsTheoretical Computer Science10.1016/j.tcs.2019.05.029Online publication date: Jul-2019
  • (2019)Synthesizing optimally resilient controllersActa Informatica10.1007/s00236-019-00345-757:1-2(195-221)Online publication date: 31-Oct-2019
  • (2018)Quantitative Reductions and Vertex-Ranked Infinite GamesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.277.1277(1-15)Online publication date: 7-Sep-2018
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media