Finitary winning in ω-regular games

ACM Transactions on Computational Logic

Volumn 11, Issue 1, 2009, Pages

  Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^b   Horn, Florian ^c,d  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b EPFL   (Sweden)

^c RWTH AACHEN UNIVERSITY   (Germany)

^d UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Finitary objectives; Games on graphs; Model checking; regular objectives

Indexed keywords

GAME THEORY; POLYNOMIAL APPROXIMATION;

B TRANSITIONS; FINITARY OBJECTIVES; GAMES ON GRAPHS; MEMORY REQUIREMENTS; POLYNOMIAL-TIME; REACHABILITY; REACTIVE SYSTEM; WINNING STRATEGY;

MODEL CHECKING;

EID: 75649152053     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1614431.1614432     Document Type: Article

References (22)

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-2153 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 ́ NSKI, 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 ́ NSKI, 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 ́ NSKI, 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. (Pubitemid 17513624)
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.