A measured collapse of the modal μ-calculus alternation hierarchy

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

Volumn 2996, Issue , 2004, Pages 522-533

  Bustan, Doron ^a,b   Kupferman, Orna ^a,b   Vardi, Moshe Y ^a,b  

^a Rice University   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER CIRCUITS; MODEL CHECKING; RECONFIGURABLE HARDWARE; TEMPORAL LOGIC;

ALTERNATION HIERARCHIES; CHARACTERISTIC FUNCTIONS; CONCURRENT PROGRAM; ENUMERATIVE ALGORITHMS; FUNDAMENTAL THEOREMS; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; STATE EXPLOSION PROBLEMS;

CALCULATIONS;

EID: 35048895993     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_46     Document Type: Article

References (33)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of databases. Addison-Wesley, 1995.
2. J. F. A. K. van Benthem. Modal Logic and Classical Logic. Bibliopolis, Naples, 1985.
3. G. Bhat and R. Cleaveland. Efficient local model-checking for fragments of the modal μ-calculus. In Proc. TACAS, LNCS 1055, 1996.
4. J.C. Bradfield. The modal μ-calculus alternation hierarchy is strict. TCS, 195(2):133-153, 1998.
5. R.E. Bryant. Graph-based algorithms for boolean-function manipulation. IEEE Trans, on Computers, C-35(8), 1986.
6. 20 states and beyond. I&C, 98(2):142-170, 1992.
7. R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi", Algebraic decision diagrams and their applications. FMSD, 10(2/3): 171-206, 1997
8. A. Chakrabarti, L. de Alfaro, T.A. Henzinger, M. Jurdzinski, and F.Y.C. Mang. Interface compatibility checking for software modules. In 14th CAV, LNCS 2404, pp. 428-441, 2002.
9. H.D. Ebbinghaus and J. Flum. Finite Model Theory. Perspectives in Mathematical Logic. Springer-Verlag, 1995.
10. E.A. Emerson. Modal Checking and the μ-Calculus, Descriptive Complexity and Finite Models, American Mathematical Society, pp. 185-214, 1997.
11. E.A. Emerson and E.M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th ICALP, pp. 169-181, 1980.
12. E.A. Emerson, C. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In Proc. 5th CAV, LNCS 697, pp. 385-396, 1993.
13. E.A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proc. 1st LICS, pp. 267-278, 1986.
14. K. Etessami, Th. Wilke, and R. A. Schuller. Fair simulation relations, parity games, and state space reduction for Büchi automata. In Proc. 28th ICALP, LNCS 2076, pp. 694-707, 2001.
15. Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265-280, 1986.
16. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. I&C, 173(1):64-81, 2002.
17. N. Immerman. Relational queries computable in polynomial time; I&C, 68:86-104, 1986.
18. M. Jurdzinski J. Voge. A discrete strategy improvement algorithm for solving parity games. In E. A. Emerson and A. P. Sistla, editors, Proc 12th CAV, LNCS 1855, pp. 202-215, 2000.
19. M. Jurdzinski. Deciding the winner in parity games is in UP ∩ co-UP. 1PL, 68(3):119-124, 1998.
20. M. Jurdzinski. Small progress measures for solving parity games. In Proc. 17th TACAS, LNCS 1770, pp. 290-301, 2000.
21. N. Klarlund. Progress measures for complementation of ω-automata with applications to temporal logic. In Proc. 32nd FOCS, pp. 358-367, 1991.
22. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333-354, 1983.
23. O. Kupferman and M.Y. Vardi. Weak alternating automata and tree automata emptiness. In Proc. 30th STOC, pp. 224-233, 1998.
24. O. Kupferman and M.Y. Vardi. Weak alternating automata are not that weak. ACM ToCL, 2001(2):408-429, 2001.
25. O. Kupferman, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. J. ACM, 47(2):312-360, 2000.
26. D. Leivant. Inductive definitions over finite structures. I&C, 89:95-108, 1990.
27. D. Long, A. Brown, E. Clarke, S. Jha, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In Proc. 6th CAV, LNCS 818, pp. 338-350, 1994.
28. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
29. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.
30. Klarlund N and F.B. Schneider. Proving nondeterministically specified safety properties using progress measures. I&C, 107(1):151-170, 1993.
31. D. Park. Finiteness is μ-ineffable. TCS, 3:173-181, 1976.
32. V.R. Pratt. A decidable μ-calculus: preliminary report. In 22nd FOCS, pp. 421-427, 1981.
33. H. Seidl. Fast and simple nested fixpoints. IPL, 59(6):303-308, 1996.