On the expressivity of the modal Mu-calculus

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

Volumn 1046, Issue , 1996, Pages 477-490

  Bradfield, J C ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Descriptive complexity; Logic in computer science; Temporal logic; Verification

Indexed keywords

CALCULATIONS; VERIFICATION;

ALTERNATION HIERARCHIES; DESCRIPTIVE COMPLEXITY; INFINITE SYSTEM; LOGIC IN COMPUTER SCIENCE; LOWER BOUNDS; MODAL MU CALCULUS; MU-CALCULUS; UPPER BOUND;

TEMPORAL LOGIC;

EID: 84948174414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_39     Document Type: Conference Paper

References (14)

1. [ArN90] A. Arnold and D. Niwinski, Fixed point characterization of Büchi automata on infinite trees. J. Inf. Process. Cybem., EIK 26, 451-459 (1990).
2. [Bra91] J. C. Bradfield, Verifying Temporal Properties of Systems. Birkhäuser, Boston, Mass. ISBN 0-8176-3625-0 (1991).
3. [Bra92] J. C. Bradfield, A proof assistant for symbolic model-checking. Proc. CAV '92. LNCS 663 316-329 (1993).
4. [Bra95] J. C. Bradfield, On the expressivity of the modal mu-calculus, Technical Report ECS-LFCS-95-338, LFCS, University of Edinburgh (1995). On-line via http: //www. dcs. ed. ac. uk/home/j cb/.
5. [BrS92] J. C. Bradfield and C. Stirling, Local model checking for infinite state spaces. Theoret. Comput. Sci. 96 157-174 (1992).
6. [EmL86] E. A. Emerson and C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus. Proc. First IEEE Symp. on Logic in Computer Science 267-278 (1986).
7. [Esp94] J. Esparza, On the decidability of model-checking for several μ-calculi and Petri nets, Proc. CAAP '94, LNCS 787 115-129 (1994).
8. [EsN94] J. Esparza and M. Nielsen, Decidability issues for Petri nets-a survey, J. Inform. Process. Cybernet. 30 143-160 (1994).
9. [Kai95] R. Kaivola, On modal mu-calculus and Büchi tree automata. Inf. Proc. Letters 54 17-22 (1995).
10. [Koz83] D. Kozen, Results on the propositional mu-calculus. Theoret. Comput. Sci. 27 333-354 (1983).
11. [Lar90] K. Larsen, Proof systems for satisfiability in Hennessy-Milner logic with recursion. Theoret. Comput. Sci. 72 265-288 (1990).
12. [Mos80] Y. N. Moschovakis, Descriptive set theory. North-Holland, Amsterdam & New York (1980).
13. [Niw86] D. Niwiński, On fixed point clones. Proc. 13th ICALP, LNCS 226 464-473 (1986).
14. [Rab70] M. O. Rabin, Weakly definable relations and special automata, in Y. Bar-Hillel (ed.) Mathematical Logic and Foundations of Set Theory, North-Holland, Amsterdam (1970), 1-23.