Exponential determinization for ω-automata with strong-fairness acceptance condition

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 275-282

  Safra, Shmuel ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; FINITE AUTOMATA;

ACCEPTANCE CONDITIONS; BUCHI AUTOMATA; COMPLEMENTATION; CONSTANT FACTORS; DECISION PROCEDURE; DETERMINIZATION; LOSS OF EFFICIENCIES; STREETT AUTOMATA;

AUTOMATA THEORY;

ACCEPTANCE CONDITIONS; BUCHI AUTOMATA; EXPONENTIAL DETERMINIZATION; STREETT AUTOMATA; STRONG FAIRNESS;

EID: 0027003048     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129739     Document Type: Conference Paper

References (27)

1. J. R. Buchi and L. H. Landweber. Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc, 138:295-311,1969.
2. J. R. Buchi. On a decision method in resricted second order arithmetics. In E. Nagel et al., editor, Proc. International Congr. on Logic, Method, and Phil, of Sci., I960, pages 1-12. Stanford Uni. Press, 1962.
3. A. E. 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, 1988.
4. A. E. Emerson and C. Jutla. Tree automata mu-calculus and determinacy. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 368-377, 1991.
5. A. E. Emerson and P. A. Sistla. Deciding full branching time logic. Information and Control, 61:175-201, 1984.
6. D. Harel and A. Pnueli. On the development of reactive systems. In K. R. Apt, editor, Logics and Models of Concurrent Systems, pages 477498. Springer, 1985.
7. N. Francez. Fairness. Springer-Verlag, 1986.
8. Y. Gurevich and L. Harrington. Trees, automata, and games. In Proc. 14th ACM Symp. on Theory of Computing, pages 60-65, 1982.
9. C. Jutla. Personal Communication.
10. N. Klarlund. Progress measures for complementation of w-automata with application to temporal logic. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, pages 358367, 1991.
11. N. Klarlund. Progress measures, immediate determinacy, and a subset construction for tree automata. In Proc. 7th IEEE Symp. on Logic in Computer Science, 1992. To Appear.
12. D. Kozen and J. Tiuryn. Logics of program. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, 1989.
13. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
14. A. R. Meyer. Weak monadic second order theory of successor is not elementary recursive. In Proc. Boston Univ. Logic Colloquium, 1973, volume 453, pages 132-154. Lecture Notes in Mathematics 453, Springer, 1975.
15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, New York, 1991.
16. D. E. Muller. Infinite sequences and finite machines. In Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical Design, pages 3-16, 1963.
17. J. P. Pécuchet. On the complementation of buchi autamata. Theoretical Computer Science, 47:95-98, 1986.
18. M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. AMS, 141:1-35, 1969.
19. M. O. Rabin. Weakly definable relations and special automata. In Y. Bar-hillel, editor, Proc. Symp. Math. Logic and Foundation of Set Theory, pages 1-23. North-Holland, 1970.
20. S. Safra. On the complexity of w-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, 1988. An extended version to appear in Journal of Computer and System Science.
21. R. S. Streett. Propositional dynamic logic of looping and converse is elementary decidable. Information and Control, 54:121-141, 1982.
22. S. Safra and M. Y. Vardi. On w-automata and temporal logic. In Proc. 21th ACM Symp. on Theory of Computing, 1989. To appear.
23. A. P. Sistla, M. Y. Vardi, and P. Wolper. The complementation problem for Buchi autamata with application to temporal logic. Theoretical Computer Science, 49:217-237, 1987.
24. M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. on Foundations of Computer Science, pages 327-338, 1985.
25. M. Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of program. In Proc. 17th ACM Symp. on Theory of Computing, pages 240-251, 1985.
26. M.Y. Vardi and P. Wolper. Automata theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32:183221, 1986.
27. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st IEEE Symp. on Logic in Computer Science, pages 332-344, 1986.