From nondeterministic büchi and streett automata to deterministic parity automata

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 255-264

  Piterman, Nir ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC PARITY AUTOMATA; DETERMINIZATION CONSTRUCTIONS; STREETT AUTOMATON;

CONSTRAINT THEORY; DIGITAL ARITHMETIC; PROBLEM SOLVING; SYSTEMS ANALYSIS;

AUTOMATA THEORY;

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

References (35)

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. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method, and Philosophy of Science. 1960, pp 1-12, 1962.
3. Y. Choueka. Theories of automata on ω-tapes: A simplified approach. JCSS, 8:117-141, 1974.
4. L. de Alfaro, T. Henzinger, and R. Majumdar. From verification to control: dynamic programs for omega-regular objectives. In 16th LICS, pp 279-290, 2001.
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 and C. Jutla. The complexity of tree automata and logics of programs. In 29th FOCS, pp 328-337, 1988.
7. E. Friedgut, O. Kupferman, and M. Vardi. Büchi complementation made tighter. In 2nd ATVA, LNCS 3299, pp 64-78. Springer-Verlag, 2004.
8. J. Hopcroft, R. Motwani, and J. Ullman. Introduction to Automata Theory, Languages, and Computation. 2000.
9. F. Horn. Streett games on finite graphs. In 2nd GDV, 2005.
10. M. Jurdzinski. Small progress measures for solving parity games. In 17th STACS, LNCS 1770, pp 290-301. Springer-Verlag, 2000.
11. M. Jurdziński, M. Paterson, and U. Zwick. A deterministic subexponential algorithm for solving parity games. In SODA, 2006.
12. C. Jutla. Determinization and memoryless winning strategies. IC, 133(2):117-134, 1997.
13. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In 32nd FOCS, pp. 358-367, 1991.
14. O. Kupferman and M. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In 13th LICS, pp 81-92, 1998.
15. O. Kupferman and M. Vardi. Weak alternating automata are not that weak. ACM TCL, 2(2):408-429, 2001.
16. O. Kupferman and M. Vardi. Safraless decision procedures. In 46th FOCS, 2005.
17. R. Kurshan. Complementing deterministic Büchi automata in polynomial time. JCSS, 35:59-71, 1987.
18. L. Landweber. Decision problems for ω-automata. MST, 3:376-384, 1969.
19. C. Löding. Methods for the transformation of ω-automata: Complexity and connection to second-order logic. MSc thesis, Kiel, 1998.
20. R. McNaughton. Testing and generating infinite sequences by a finite automaton. IC, 9:521-530, 1966.
21. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
22. D. Muller and P. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. TCS, 141:69-107, 1995.
23. N. Piterman and A. Pnueli. Faster solution of rabin and streett games. In 21st LICS. 2006.
24. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In 16th POPL, pp 179-190, 1989.
25. M. Rabin. Automata on infinite objects and Church's problem. AMS, 1972.
26. M. Rabin and D. Scott. Finite automata and their decision problems. IBM JRD, 3:115-125, 1959.
27. M. Roggenbach. Determinization of Büchi-automata. In Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS 2500, pp 43-60. Springer-Verlag, 2001.
28. S. Safra. On the complexity of ω-automata. In 29th FOCS, pp 319-327, 1988.
29. S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute, 1989.
30. S. Safra. Exponential determinization for ω-automata with strong-fairness acceptance condition. In 24th STOC, 1992.
31. S. Safra and M. Vardi. On ω-automata and temporal logic. In 21st STOC, pp 127-137, 1989.
32. S. Schwoon. Determinization and complementation of streett automata. In Automata, Logics, and Infinite Games: A Guide to Current Research, LNCS 2500, pp 79-91, 2001.
33. A. Sistla, M. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. In 10th ICALP, LNCS 194, pp 465-474, 1985.
34. W. Thomas. Automata on infinite objects. Handbook of TCS, pp 165-191, 1990.
35. M. Vardi. Reasoning about the past with two-way automata. In 25th ICALP, LNCS 1443, pp 628-641, 1998.