The weakness of self-complementation

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

Volumn 1563, Issue , 1999, Pages 455-466

  Kupferman, Orna ^a   Vardi, Moshe Y ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; FORESTRY; SPECIFICATIONS; TEMPORAL LOGIC;

ALTERNATING TREE AUTOMATON; COMPLEMENTATION; FIXED POINTS; GREATEST FIXED POINTS; LARGE SYSTEM; SYMBOLIC MODEL CHECKING; TREE AUTOMATA; WEAK MONADIC SECOND-ORDER LOGIC;

MODEL CHECKING;

EID: 84957053011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_43     Document Type: Conference Paper

References (29)

1. A. Arnold and P. Crubille. A linear algorithm to solve fixed-point equations. Information Processing Letters, 29(2):57-66, September 1988.
2. A. Arnold and D. Niwiński. Fixed point characterization of weak monadic logic definable sets of trees. In Tree Automata and Languages, pp. 159-188, 1992. Elsevier.
3. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, 1992.
4. J.A. Brzozowski and E. Leiss. Finite automata and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
5. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans. on Computers, C-35(8), 1986.
6. 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, 1962.
7. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Proc. 6th CAV, LNCS 818, pages 142-155, 1994.
8. E.M. Clarke, O. Grumberg, and D. Long. Verification tools for finitestate concurrent systems. In Decade of Concurrency - Reflections and Perspectives (Proceedings of REX School), LNCS 803, pages 124-175, 1993.
9. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114-133, January 1981.
10. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. In Proc. 3rd CAV, LNCS 575, pages 48-58, 1991.
11. J. Elgaard, N. Klarlund, and A. Möller. Mona 1.x: new techniques for WS1S and WS2S. In Proc 10th CAV, LNCS 1427, pages 516-520, 1998.
12. E.A. Emerson and C.-L. Lei. Eficient model checking in fragments of the propositional μ-calculus. In Proc. 1st LICS, pages 267-278, 1986.
13. R.H. Hardin, R.P. Kurshan, S.K. Shukla, and M.Y. Vardi. A new heuristic for bad cycle detection using BDDs. In Proc. 9th CAV, LNCS 1254, pages 268-278, 1997.
14. N. Klarlund. Mona & Fido: The logic-automaton connection in practice. In Computer Science Logic, '97, Lecture Notes in Computer Science, 1998.
15. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
16. R.P. Kurshan. Computer Aided Verification of Coordinating Processes. Princeton Univ. Press, 1994.
17. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. In Proc. 5th ISTCS, pages 147-158. IEEE Computer Society Press, 1997.
18. O. Kupferman and M.Y. Vardi. Freedom, weakness, and determinism: from linear-time to branching-time. In Proc. 13th LICS, pages 81-92, 1998.
19. O. Kupferman and M.Y. Vardi. Weak alternating automata and tree automata emptiness. In Proc. 30th STOC, pages 224-233, 1998.
20. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
21. R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521-530, 1966.
22. D.E. Muller and P.E. Schupp. Alternating automata on infinite trees. Theoretical Computer Science, 54,:267-276, 1987.
23. D.E. Muller, A. Saoudi, and P.E. Schupp. Alternating automata, the weak monadic theory of the tree and its complexity. In Proc. 13th ICALP, 1986.
24. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
25. M.O. Rabin. Weakly definable relations and special automata. In Proc. Symp. Math. Logic and Foundations of Set Theory, pages 1-23. North Holland, 1970.
26. W. Thomas. Automata on infinite objects. Handbook of Theoretical Computer Science, pages 165-191, 1990.
27. M.Y. Vardi. An automata-theoretic approach to linear temporal logic. In F. Moller and G. Birtwistle, editors, Logics for Concurrency: Structure versus Automata, LNCS 1043, pages 238-266, 1996.
28. M.Y. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proc. 1st LICS, pages 322-331, 1986.
29. M.Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, November 1994.