Faster solutions of Rabin and streett games

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 275-284

  Piterman, Nir ^a   Pnueli, Amir ^b  

^a EPFL   (Switzerland)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL MECHANICS; PROBLEM SOLVING;

RANKING METHOD; STREETT GAME; WINNING CONDITION;

GAME THEORY;

EID: 34547379243     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.23     Document Type: Conference Paper

References (29)

1. H. Björklund, S. Sandberg, and S. Vorobyov. A discrete subexponential algorithm for parity games. In 20th STACS, LNCS 2607, pp. 663-674. Springer-Verlag, 2003.
2. J. Büchi and L. Landweber. Solving sequential conditions by finite-state strategies. TAMS, 138:295-311, 1969.
3. D. Bustan, O. Kupferman, and M. Vardi. A measured collapse of the modal μ-calculus alternation hierarchy. In Proc. 21st STACS, LNCS 2996, pp. 522-533. 2004.
4. A. Church. Logic, arithmetic and automata. In Proc. 1962 Int. Congr. Math., pages 23-25, Upsala, 1963.
5. S. Dziembowski, M. Jurdzinski, and I. Walukiewicz. How much memory is needed to win infinite games. In 12th LICS, pp. 99-110, 1997.
6. E. Emerson. Automata, tableaux and temporal logics. In ICLP, LNCS 193, pp 79-88. Springer-Verlag, 1985.
7. E. Emerson and C. Jutla. The complexity of tree automata and logic of programs. In 29th FOCS, pp. 328-337, 1988.
8. E. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In 32nd FOCS, pp. 368-377, 1991.
9. E. A. Emerson and C. L. Lei. Efficient model-checking in fragments of the propositional modal μ-calculus. In 1st LICS, pp. 267-278, 1986.
10. K. Etessami, T. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In 28th ICALP, LNCS 2076, pp. 694-707. 2001.
11. Y. Gurevich and L. Harrington. Automata, trees and games. In 14th STOC, pp. 60-65, 1982.
12. F. Horn. Streett games on finite graphs. In 2nd GDV, 2005.
13. M. Jurdzinski. Small progress measures for solving parity games. In 17th STACS, LNCS 1770, pp. 290-301. 2000.
14. M. Jurdziński, M. Paterson, and U. Zwick. A deterministic subexponential algorithm for solving parity games. In SODA, 2006.
15. N. Klarlund. Progress measures, immediate determinacy, and a subset construction for tree automata. ARAL, 69(2-3):243-268, 1994.
16. N. Klarlund and D. Kozen. Rabin measures. Chicago JTCS, 1995.
17. O. Kupferman and M. Vardi. Weak alternating automata and tree automata emptiness. In 30th STOC, pp. 224-233, 1998.
18. D. Long, A. Brown, E. Clarke, S. Jha, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In 6th CAV, LNCS 818, pp. 338-350, 1994.
19. R. McNaughton. Infinite games played on finite graphs. APAL, 65(2):149-184, 1993.
20. N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of Reactive(1) Designs. In 7th VMCAI, LNCS 3855, pp 364-380, 2006.
21. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In 16th POPL, pp. 179-190, 1989.
22. M. Rabin. Decidability of second order theories and automata on infinite trees. TAMS, 141:1-35, 1969.
23. M. Rabin. Automata on Infinite Objects and Churc's Problem, volume 13 of Regional Conference Series in Mathematics. AMS, 1972.
24. S. Safra. On the complexity of ω-automata. In 29th FOCS, pp. 319-327, 1988.
25. R. Streett. Propositional dynamic logic of looping and converse is elementarily decidable. IC, 54:121-141, 1982.
26. W. Thomas. Automata on infinite objects. In Handbook of TCS, volume B, chapter 4, pp. 165-191. MIT Press, 1990.
27. J. Voge and M. Jurdzinski. A discrete strategy improvement algorithm for solving parity games. In 12th CAV, LNCS 1855, Springer-Verlag, pp. 202-215, 2000.
28. T. Wilke. Alternating tree automata, parity games, and modal μ-calculus. Bull. Soc. Math. Belg., 8(2), May 2001.
29. W. Zielonka. Infinite games on finitely coloured graphs with applications to automata on infinite trees. TCS, 200(1-2):135-183, 1998.