From nondeterministic BÜchi and Streett automata to deterministic parity automata

Logical Methods in Computer Science

Volumn 3, Issue 3, 2007, Pages

  Piterman, Nir ^a  

^a EPFL   (Switzerland)

Author keywords

B chi; Determinization; Finite automata; Parity; Streett

Indexed keywords

COMPUTERS; FINITE AUTOMATA;

ACCEPTANCE CONDITIONS; DETERMINISTIC AUTOMATA; DETERMINIZATION; LOGICAL SPECIFICATIONS; PARITY; SATISFIABILITY; STREETT; STREETT AUTOMATA;

COMPUTER SCIENCE;

EID: 67649333975     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(3:5)2007     Document Type: Article

References (41)

1. H. Björklund, S. Sandberg, and S. Vorobyov. A discrete subexponential algorithm for parity games. In 20th Annual Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes in Computer Science, pages 663-674. Springer-Verlag, 2003.
2. J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. International Congress on Logic, Method, and Philosophy of Science. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
3. Y. Choueka. Theories of automata on !-tapes: A simplified approach. Journal of Computer and System Sciences, 8:117-141, 1974.
4. O. Carton and R. Maceiras. Computing the rabin index of a parity automaton. Theoretical Informatics and Applications, 33(6):495-506, 1999.
5. L. de Alfaro, T.A. Henzinger, and R. Majumdar. From verification to control: dynamic programs for omega-regular objectives. In Proceedings of the 16th Annual Symposium on Logic in Computer Science, pages 279-290. IEEE Computer Society Press, 2001.
6. S. Dziembowski, M. Jurdziński, and I. Walukiewicz. How much memory is needed to win infinite games. In Proc. 12th IEEE Symp. on Logic in Computer Science, pages 99-110, 1997.
7. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 328-337, White Plains, October 1988.
8. E. Friedgut, O. Kupferman, and M.Y. Vardi. Büchi complementation made tighter. In 2nd International Symposium on Automated Technology for Verification and Analysis, volume 3299 of Lecture Notes in Computer Science, pages 64-78. Springer-Verlag, 2004.
9. J.E. Hopcroft, R. Motwani, and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation (2nd Edition). Addison-Wesley, 2000.
10. F. Horn. Streett games on finite graphs. In Proc. 2nd Workshop on Games in Design and Verification, 2005.
11. M. Jurdziński, M. Paterson, and U. Zwick. A deterministic subexponential algorithm for solving parity games. In Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pages 117-123. ACM/SIAM, 2006.
12. M. Jurdziński. Small progress measures for solving parity games. In 17th Annual Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 290-301. Springer-Verlag, 2000.
13. C.S. Jutla. Determinization and memoryless winning strategies. Information and Computation, 133(2):117-134, 1997.
14. N. Klarlund. Progress measures for complementation of !-automata with applications to temporal logic. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 358-367, San Juan, October 1991.
15. O. Kupferman, G. Morgenstern, and A. Murano. Typeness for !-regular automata. In 2nd International Symposium on Automated Technology for Verification and Analysis, volume 3299 of Lecture Notes in Computer Science, pages 324-338. Springer-Verlag, 2004.
16. S.C. Krishnan, A. Puri, R.K. Brayton, and P.P. Varaiya. The Rabin index and chain automata, with applications to automata and games. In Computer Aided Verification, Proc. 7th International Conference, pages 253-266, Liege, July 1995.
17. R.P. Kurshan. Complementing deterministic Büchi automata in polynomial time. Journal of Computer and System Science, 35:59-71, 1987.
18. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science, pages 81-92, June 1998.
19. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM Trans. on Computational Logic, 2(2):408-429, July 2001.
20. O. Kupferman and M.Y. Vardi. Safraless decision procedures. In Proc. 46th IEEE Symp. on Foundations of Computer Science, pages 531-540, Pittsburgh, October 2005.
21. L.H. Landweber. Decision problems for !-automata. Mathematical Systems Theory, 3:376-384, 1969.
22. C. Löding. Methods for the transformation of !-automata: Complexity and connection to secondorder logic. Master’s thesis, Christian-Albrechts-University of Kiel, 1998.
23. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
24. M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
25. D.E. Muller and P.E. Schupp. Simulating alternating tree automata by nondeterministic automata: New results and new proofs of theorems of Rabin, McNaughton and Safra. Theoretical Computer Science, 141:69-107, 1995.
26. N. Piterman. From nondeterministic Büchi and Streett automata to deterministic parity automata. In Proc. 25th Symposium on Logic in Computer Science, pages 255-264. IEEE press, 2006.
27. N. Piterman and A. Pnueli. Faster solution of Rabin and Streett games. In Proc. 21st Symposium on Logic in Computer Science, pages 275-284. IEEE, IEEE press, 2006.
28. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, pages 179-190, Austin, January 1989.
29. M.O. Rabin. Automata on infinite objects and Church’s problem. Amer. Mathematical Society, 1972.
30. M. Roggenbach. Determinization of Büchi-automata. In Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science, pages 43-60. Springer-Verlag, 2001.
31. M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
32. S. Safra. On the complexity of !-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
33. S. Safra. Complexity of automata on infinite objects. PhD thesis, Weizmann Institute of Science, Rehovot, Israel, 1989.
34. S. Safra. Exponential determinization for !-automata with strong-fairness acceptance condition. In Proc. 24th ACM Symp. on Theory of Computing, Victoria, May 1992.
35. S. Schwoon. Determinization and complementation of Streett automata. In Automata, Logics, and Infinite Games: A Guide to Current Research, volume 2500 of Lecture Notes in Computer Science, pages 79-91. Springer-Verlag, 2001.
36. S. Safra and M.Y. Vardi. On !-automata and temporal logic. In Proc. 21st ACM Symp. on Theory of Computing, pages 127-137, Seattle, May 1989.
37. A.P. Sistla, M.Y. Vardi, and P. Wolper. The complementation problem for Büchi automata with applications to temporal logic. In Proc. 10th International Colloquium on Automata, Languages and Programming, volume 194 of Lecture Notes in Computer Science, pages 465-474, Nafplion, July 1985. Springer-Verlag.
38. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 133-191, 1990.
39. M.Y. Vardi. Reasoning about the past with two-way automata. In Proc. 25th International Coll. on Automata, Languages, and Programming, volume 1443 of Lecture Notes in Computer Science, pages 628-641. Springer-Verlag, July 1998.
40. K. Wagner. On !-regular sets. Information and Control, 43:123-177, 1979.
41. Q. Yan. Lower bounds for complementation of !-automata via the full automata technique. In Proc. 33rd Intl. Colloq. on Automata, Languages and Pr ogramming, volume 4052 of Lecture Notes in Computer Science, pages 589-600. Springer-Verlag, 2006.