Weak Alternating Automata Are Not that Weak

ACM Transactions on Computational Logic

Volumn 2, Issue 3, 2001, Pages 408-429

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

complementation; Theory; Verification; Weak alternating automata

Indexed keywords

EID: 70350683418     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/377978.377993     Document Type: Article

References (37)

1. Brzozowski, J. A. and Leiss, E. 1980. Finite automata and sequential networks. Theoretical Computer Science 10, 19-35
2. Btjchi, J. R. 1962. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method. and Philos. Sci. 1960. Stanford University Press, Stanford, 1-12
3. Chandra, A. K., Kozen, D. C., and Stockmeyer, L. J. 1981. Alternation. Journal of the Association for Computing Machinery 28, 1(January), 114-133
4. Clarke, E. M., Draghicescu, I. A., and Kurshan, R. P. 1993. A unified approach for showing language containment and equivalence between various types of “-automata. Information Processing Letters 46, 301-308
5. Drusinsky, D. and Harel, D. 1994. On the power of bounded concurrency I: Finite automata. Journal of the ACM 41, 3, 517-539
6. Emerson, E. A. and Jutla, C. 1988. The complexity of tree automata and logics of programs. In Proc. 29th IEEE Symp. on Foundations of Computer Science. White Plains, 328337
7. Emerson, E. A. and Jutla, C. 1991. Tree automata, μ-calculus and determinacy. In Proc. 32nd IEEE Symp. on Foundations of Computer Science. San Juan, 368-377
8. Emerson, E. A., Jutla, C., and Sistla, A. P. 1993. On model-checking for fragments of μcalculus. In Computer Aided Verification, Proc. 5th Int. Conference. Vol. 697. Lecture Notes in Computer Science, Springer-Verlag, Elounda, Crete, 385-396
9. Holzmann, G. 1991. Design and Validation of Computer Protocols. Prentice-Hall International Editions
10. Klarlund, N. 1990. Progress measures and finite arguments for infinite computations. Ph.D. thesis, Cornell University
11. Klarlund, N. 1991. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd IEEE Symp. on Foundations of Computer Science, San Juan, 358-367
12. Kupferman, O. and Vardi, M. Y. 1998a. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th IEEE Symp. on Logic in Computer Science. 81-92
13. Kupferman, O. and Vardi, M. Y. 1998b. Weak alternating automata and tree automata emptiness. In Proc. 30th ACM Symp. on Theory of Computing. Dallas, 224-233
14. Kupferman, O. and Vardi, M. Y. 1999. The weakness of self-complementation. In Proc. 16th Symp. on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 1563. Springer-Verlag, 455-466
15. Kupferman, O., Vardi, M. Y., and Wolper, P. 2000. An automata-theoretic approach to branching-time model checking. Journal of the ACM 47, 2 (March), 312-360
16. Kurshan, R. P. 1994. Computer Aided Verification of Coordinating Processes, Princeton Univ. Press
17. Landweber, L. H. 1969. Decision problems for “-automata. Mathematical Systems Theory 3, 376-384
18. Lindsay, P. 1988. On alternating ω -automata. Theoretical computer science 43, 107-116
19. Looding, C. and Thomas, W. 2000. Alternating automata and logics over infinite words. In Theoretical Compter Science-Exploring New Frontiers of Theoretical Informatics. Lecture Notes in Computer Science, vol. 1872, Springer-Verlag, 521-535
20. Mcnaughton, R. 1966. Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521-530
21. Michel, M. 1988. Complementation is more difficult with automata on infinite words. CNET, PARIS
22. Miyano, S. and Hayashi, T. 1984. Alternating finite automata on ωwords. Theoretical Computer Science.32, 321-330
23. Mostowski, A. W. 1984. Regular expressions for infinite trees and a standard form of automata. In Computation Theory. Lecture Notes in Computer Science, vol. 208, Springer-Verlag, 157-168
24. Muller, D. E. 1963. Infinite sequences and finite machines. In Proc. 4th IEEE Symp. on Switching Circuit Theory and Logical design. 3-16
25. Muller, D. E., Saoudi, A., and Schupp, P. E. 1986. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th Int. Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 226, Springer-Verlag
26. Muller, D. E. and Schupp, P. E. 1987. Alternating automata on infinite trees. Theoretical Computer Science 54, 267-276
27. Piterman, N. 2000. Extending temporal logic with ωautomata. M.Sc. Thesis, The Weizmann Institute of Science, Israel,
28. Pnueli, A. and Rosner, R. 1989. On the synthesis of a reactive module. In Proc. 16th ACM Symp. on Principles of Programming Languages, Austin, 179-190
29. Rabin, M. O. 1969. Decidability of second order theories and automata on infinite trees. Transaction oftheAMS 141, 1-35
30. Rabin, M. O. 1970. Weakly definable relations and special automata. In Proc. Symp. Math. Logic and Foundations of Set Theory, North Holland, 1-23
31. Safra, S. 1988. On the complexity of “-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science. White Plains, 319-327
32. Sistla, A. P., Vardi, M. Y., and Wolper, P. 1987. The complementation problem for Büchi automata with applications to temporal logic. Theoretical Computer Science 49, 217-237
33. Tasiran, S., Hojati, R., and Brayton, R. K. 1995. Language containment using non-deterministic omega-automata. In Proc. of CHARME'95: Advanced Research Working Conference on Correct Hardware Design and Verification Methods. Lecture Notes in Computer Science. vol. 987. Springer-Verlag, Frankfurt, 261-277
34. Thomas, W. 1990. Automata on infinite objects. Handbook of Theoretical Computer Science, 165191
35. Vardi, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Logics for Concurrency: Structure versus Automata, F. Moller and G. Birtwistle, Eds. Lecture Notes in Computer Science, vol. 1043, Springer-Verlag, Berlin, 238-266
36. Vardi, M. Y. and Wolper, P. 1986. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, Cambridge, 332-344
37. Vardi, M. Y. and Wolper, P. 1994. Reasoning about infinite computations. Information and Computation 115, 1(November), 1-37