On the universal and existential fragments of the μ-calculus

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

Volumn 2619, Issue , 2003, Pages 49-64

  Henzinger, Thomas A ^a   Kupferman, Orna ^a   Majumdar, Rupak ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; TEMPORAL LOGIC;

GREATEST FIXED POINTS; MU-CALCULUS; NUMBER OF SWITCHES; POLYNOMIAL-TIME; PRACTICAL IMPORTANCE; SATISFIABILITY;

MODEL CHECKING;

EID: 35248821143     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_5     Document Type: Article

References (33)

1. B. Banieqbal and H. Barringer. Temporal logic with fixed points. Temporal Logic in Specification, LNCS 398, pages 62-74. Springer-Verlag, 1987.
2. 20 states and beyond. Information and Computation, 98(2):142-170, June 1992.
3. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In Logic of Programs, LNCS 131, pages 52-71. Springer-Verlag, 1981.
4. E. Clarke, E. Emerson, and A. Sistla. Automatic verification of finite-state concurrent systems using temporal-logic specifications. ACM Trans. on Programming Languages and Systems, 8(2):244-263, 1986.
5. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 1999.
6. R. Cleaveland and B. Steffen. A linear-time model-checking algorithm for the alternation-free modal μ-calculus. Formal Methods in System Design, 2:121-147, 1993.
7. M. Dam. CTL* and ECTL* as fragments of the modal μ-calculus. Theoretical Computer Science, 126:77-96, 1994.
8. E. Emerson and J. Halpern. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1):151-178, 1986.
9. E. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proc. Foundations of Computer Science, pages 328-337. IEEE Press, 1988.
10. E. Emerson and C. Jutla. Tree automata, μ-calculus and determinacy. In Proc. Foundations of Computer Science, pages 368-377. IEEE Press, 1991.
11. E. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In Computer Aided Verification, LNCS 697, pages 385-396. Springer-Verlag, 1993.
12. E. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional μ-calculus. In Proc. Logic in Computer Science, pages 267-278. 1986.
13. M. Fischer and R. Ladner. Prepositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18:194-211, 1979.
14. R. Greenlaw, H. Hoover, and W. Ruzzo. Limits of Parallel Computation. Oxford University Press, 1995.
15. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
16. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32:137-161, 1985.
17. N. Immerman. Number of quantifiers is better than number of tape cells. Journal of Computer and System Sciences, 22(3):384-406, 1981.
18. D. Janin and I. Walukiewicz. On the expressive completeness of the prepositional μ-calculus with respect to the monadic second-order logic. In Concurrency Theory, LNCS 1119, pages 263-277. Springer-Verlag, 1996.
19. M. Jurdzinski. Deciding the winner in parity games is in UP ∩ co-UP. Information Processing Letters, 68(3):119-124, 1998.
20. M. Jurdzinski. Small progress measures for solving parity games. In Theoretical Aspects of Computer Science, LNCS 1770, pages 290-301. Springer-Verlag, 2000.
21. D. Kozen. Results on the propositional μ-calculus. Theoretical Computer Science, 27:333-354, 1983.
22. D. Kozen. A finite model theorem for the propositional μ-calculus. Studia Logica, 47(3):333-354, 1988.
23. O. Kupferman and M. Vardi. An automata-theoretic approach to modular model checking. ACM Trans. on Programming Languages and Systems, 22:87-128, 2000.
24. O. Kupferman, M. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. Journal of the ACM, 47(2):312-360, 2000.
25. R. Kurshan. FormalCheck User's Manual. Cadence Design Inc., 1998.
26. D. Long, A. Brown, E. Clarke, S. Jha, and W. Marrero. An improved algorithm for the evaluation of fixpoint expressions. In Computer Aided Verification, LNCS 818, pages 338-350. Springer-Verlag, 1994.
27. K. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
28. A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 123-144. Springer-Verlag, 1985.
29. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. Principles of Programming Languages, pages 179-190: ACM Press, 1989.
30. P. Ramadge and W. Wonham. The control of discrete-event systems. IEEE Trans. on Control Theory, 77:81-98, 1989.
31. H. Seidl. Fast and simple nested fixpoints. Information Processing Letters, 59(6):303-308, 1996.
32. M. Vardi. A temporal fixpoint calculus. In Proc. Principles of Programming Languages, pages 250-259. ACM Press, 1988.
33. M. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc. Theory of Computing, pages 240-251. ACM Press, 1985.