Typeness for ω-regular automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3299, Issue , 2004, Pages 324-338

  Kupferman, Orna ^a   Morgenstern, Gila ^a   Murano, Aniello ^a,b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EQUIVALENCE CLASSES;

ACCEPTANCE CONDITIONS; BLOW-UP; INFINITE WORD; SUBSET CONSTRUCTIONS;

AUTOMATA THEORY;

EID: 35048848669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30476-0_27     Document Type: Article

References (24)

1. [AFF+02] R. Armoni, L. Fix, A. Flaisher, R. Gerth, B. Ginsburg, T. Kanza, A. Landver, S. Mador-Haim, E. Singerman, A. Tiemeyer, M.Y. Vardi, and Y. Zbar. The ForSpec temporal logic: A new temporal property-specification logic. In Proc. 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2280 of Lecture Notes in Computer Science, pages 296-211, Grenoble, France, April 2002. Springer-Verlag.
2. +01] I. Beer, S. Ben-David, C. Eisner, D. Fisman, A. Gringauze, and Y. Rodeh. The temporal logic sugar. In Proc. 13th International Conference on Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 363-367, Paris, France, July 2001. Springer-Verlag.
3. [BJW01] B. Boigelot, S. Jodogne, and P. Wolper. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proc. International Joint Conference on Automated Reasoning (IJCAR), volume 2083 of Lecture Notes in Computer Science, pages 611-625, Siena, June 2001. Springer-Verlag.
4. [Büc62] J.R. Büchi. On a decision method in restricted second order arithmetic. In Proc. Internat. Congr. Logic, Method, and Philos. Sci. 1960, pages 1-12, Stanford, 1962. Stanford University Press.
5. [Kam85] M. Kaminski. A classification of ω-regular languages. Theoretical Computer Science, 36:217-229, 1985.
6. [KPB94] S.C. Krishnan, A. Puri, and R.K. Brayton. Deterministic ω-automata vis-a-vis deterministic Büchi automata. In Algorithms and Computations, volume 834 of Lecture Notes in Computer Science, pages 378-386. Springer-Verlag, 1994.
7. [Kur94] R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
8. [KV98a] 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.
9. [KV98b] O. Kupferman and M.Y. Vardi. Relating linear and branching model checking. In IFIP Working Conference on Programming Concepts and Methods, pages 304-326, New York, June 1998. Chapman & Hall.
10. [KVW00] O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, March 2000.
11. [Lan69] L.H. Landweber. Decision problems for ω-automata. Mathematical Systems Theory, 3:376-384, 1969.
12. [Löd99] C. Löding. Optimal bounds for the transformation of omega-automata. In Proc. 19th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1738 of Lecture Notes in ComputerScience,pages 97-109, December 1999.
13. [McN66] R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
14. [MH84] S. Miyano and T. Hayashi. Alternating finite automata on ω-words. Theoretical Computer Science, 32:321-330, 1984.
15. [Mic88] M. Michel. Complementation is more difficult with automata on infinite words. CNET, Paris, 1988.
16. [MS97] O. Maler and L. Staiger. On syntactic congruences for ω-languages. Theoretical Computer Science, 183(1):93-112, 1997.
17. [MSS86] D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th International Colloquium on Automata, Languages and Programming, volume 226 of Lecture Notes in Computer Science. Springer-Verlag, 1986.
18. [Rab69] M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
19. [RS59] M.O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:115-125, 1959.
20. [Saf88] S. Safra. On the complexity of ω-automata. In Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319-327, White Plains, October 1988.
21. [SV89] 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.
22. [Tho90] W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
23. [VW86] M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st Symp. on Logic in Computer Science, pages 332-344, Cambridge, June 1986.
24. [VW94] M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.