On the universal and existential fragments of the μ-calculus

Theoretical Computer Science

Volumn 354, Issue 2, 2006, Pages 173-186

  Henzinger, Thomas A ^a,b   Kupferman, Orna ^c   Majumdar, Rupak ^d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b EPFL   (Switzerland)

^c HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^d University of California   (United States)

Author keywords

Calculus; Automata and logic; Model checking; Satisfiability

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FORMAL LOGIC; MATHEMATICAL MODELS;

AUTOMATA AND LOGIC; MODEL CHECKING; SATISFIABILITY;

DIFFERENTIATION (CALCULUS);

EID: 33644688409     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.015     Document Type: Conference Paper

References (40)

1. A. Arnold, and D. Niwinski Rudiments of the μ -Calculus 2001 Elsevier Science Amsterdam
2. B. Banieqbal, H. Barringer, Temporal logic with fixed points, in: B. Banieqbal, H. Barringer, A. Pnueli (Eds.), Temporal Logic in Specification, Lecture Notes in Computer Science, vol. 398, Springer, Berlin, 1987, pp. 62-74.
3. J.C. Bradfield The modal μ -calculus alternation hierarchy is strict Theoret. Comput. Sci. 195 2 1998 133 153
4. J.C. Bradfield Fixpoint alternation: arithmetic, transition systems, and the binary tree Theoret. Inform. Appl. 33 4/5 1999 341 356
5. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang Symbolic model checking: 10 20 states and beyond Inform. and Comput. 98 2 1992 142 170
6. E.M. Clarke, E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, in: D. Kozen (Ed.), Proc. Workshop on Logic of Programs, Lecture Notes in Computer Science, vol. 131, Springer, Berlin, 1981, pp. 52-71.
7. E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic verification of finite-state concurrent systems using temporal-logic specifications ACM Trans. Programming Languages Systems 8 2 1986 244 263
8. E.M. Clarke, O. Grumberg, and D. Peled Model Checking 1999 MIT Press Cambridge, MA
9. R.J. Cleaveland, and B. Steffen A linear-time model-checking algorithm for the alternation-free modal μ -calculus Formal Methods System Design 2 1993 121 147
10. M. Dam CTL * and ECTL * as fragments of the modal μ -calculus Theoret. Comput. Sci. 126 1994 77 96
11. E.A. Emerson, and J.Y. Halpern Sometimes and not never revisited: on branching versus linear time J. ACM 33 1 1986 151 178
12. E.A. Emerson, and C. Jutla The complexity of tree automata and logics of programs Proc. 29th IEEE Symp. on Foundations of Computer Science 1988 IEEE Computer Society Press Silver Spring, MD 328 337
13. E.A. Emerson, and C. Jutla Tree automata, mu-calculus and determinancy Proc. 32nd Annu. Symp. on Foundations of Computer Science 1991 IEEE Computer Society Press Silver Spring, MD 368 377
14. E.A. Emerson, C. Jutla, A.P. Sistla, On model-checking for fragments of μ -calculus, in: C. Courcoubetis (Ed.), Computer Aided Verification, Lecture Notes in Computer Science, vol. 697, Springer, Berlin, 1993, pp. 385-396.
15. E.A. Emerson, and C.-L. Lei Efficient model checking in fragments of the propositional μ -calculus Proc. First Symp. Logic in Computer Science 1986 IEEE Computer Society Press Silver Spring, MD 267 278
16. M.J. Fischer, and R.E. Ladner Propositional dynamic logic of regular programs J. Comput. Systems Sci. 18 1979 194 211
17. R. Greenlaw, H.J. Hoover, and W.L. Ruzzo Limits of Parallel Computation 1995 Oxford University Press Oxford
18. O. Grumberg, and D.E. Long Model checking and modular verification ACM Trans. Programming Languages Systems 16 3 1994 843 871
19. M. Hennessy, and R. Milner Algebraic laws for nondeterminism and concurrency J. ACM 32 1985 137 161
20. N. Immerman Number of quantifiers is better than number of tape cells J. Comput. System Sci. 22 3 1981 384 406
21. D. Janin, I. Walukiewicz, Automata for the modal μ -calculus and related results. in: J. Wiedermann, P. Hájek (Eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, vol. 969, Springer, Berlin, 1995, pp. 552-562.
22. D. Janin, I. Walukiewicz, On the expressive completeness of the propositional μ -calculus with respect to the monadic second order logic, in: U. Montanari, V. Sassone (Eds.), Conference on Concurrency Theory, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 263-277.
23. M. Jurdzinski Deciding the winner in parity games is in UP ∩ co-UP Inform. Process. Lett. 68 3 1998 119 124
24. M. Jurdzinski, Small progress measures for solving parity games, in: H. Reichel, S. Tison (Eds.), Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 1770, Springer, Berlin, 2000, pp. 290-301.
25. D. Kozen Results on the propositional μ -calculus Theoret. Comput. Sci. 27 1983 333 354
26. D. Kozen A finite model theorem for the propositional μ -calculus Studia Logica 47 3 1988 333 354
27. O. Kupferman, and M.Y. Vardi An automata-theoretic approach to modular model checking ACM Trans. Programming Languages Systems 22 2000 87 128
28. O. Kupferman, M.Y. Vardi, and P. Wolper An automata-theoretic approach to branching-time model checking J. ACM 47 2 2000 312 360
29. R.P. Kurshan FormalCheck User's Manual 1998 Cadence Design, Inc.
30. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem Property-preserving abstractions for the verification of concurrent systems Formal Methods in System Design 6 1995 11 44
31. D. Long, A. Brown, E. Clarke, S. Jha, W. Marrero, An improved algorithm for the evaluation of fixpoint expressions, in: D.L. Dill (Ed.), Computer Aided Verification, Lecture Notes in Computer Science, vol. 818, Springer, Berlin, 1994, pp. 338-350.
32. R.S. Lubarsky μ -Definable sets of integers J. Symbolic Logic 58 1993 291 313
33. K.L. McMillan Symbolic Model Checking 1993 Kluwer Academic Publishers Dordrecht
34. D. Niwiński, On fixed point clones, in: L. Kott (Ed.), International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 226, Springer, Berlin, 1986, pp. 464-473.
35. A. Pnueli, In transition from global to modular temporal reasoning about programs, in: K. Apt (Ed.), Logics and Models of Concurrent Systems, NATO Advanced Summer Institutes, vol. F-13, Springer, Berlin, 1985, pp. 123-144.
36. A. Pnueli, and R. Rosner On the synthesis of a reactive module Proc. 16th ACM Symp. Principles of Programming Languages 1989 ACM Press New York 179 190
37. P.J.G. Ramadge, and W.M. Wonham The control of discrete event systems IEEE Trans. Control Theory 77 1989 81 98
38. H. Seidl Fast and simple nested fixpoints Inform. Process. Lett. 59 6 1996 303 308
39. M.Y. Vardi A temporal fixpoint calculus Proc. 15th Annu. Symp. Principles of Programming Languages 1988 ACM Press New York 250 259
40. M.Y. Vardi, and L. Stockmeyer Improved upper and lower bounds for modal logics of programs Proc. 17th ACM Symp. Theory of Computing 1985 240 251