The modal mu-calculus alternation hierarchy is strict

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

Volumn 1119, Issue , 1996, Pages 233-246

  Bradfield, J C ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Alternation; Hierarchies; Mu calculi; Temporal logic

Indexed keywords

BIOMINERALIZATION; CALCULATIONS;

ALTERNATION; ALTERNATION HIERARCHIES; HIERARCHIES; MODAL MU CALCULUS; MU-CALCULI;

TEMPORAL LOGIC;

EID: 84955576663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61604-7_58     Document Type: Conference Paper

References (20)

1. H. R. Andersen, Verification of Temporal Properties of Concurrent Systems, DAIMI PB-445, Computer Science Dept, Aarhus University (1993).
2. A. Arnold and D. Niwinski, Fixed point characterization of Biichi automata on infinite trees. J. In]. Process. Cybern., EIK 26, 451-459 (1990).
3. J. Barwise, Admissible sets and structures, Springer-Verlag, Berlin/New York (1975).
4. J. C. Bradfield, Verifying Temporal Properties of Systems. Birkhüiuser, Boston, Mass. ISBN 0-8176-3625-0 (1991).
5. J. C. Bradfield, On the expressivity of the modal mu-calculus. Proc. STAGS '96, LNCS 1046, 479-490 (1996).
6. J. C. Bradfield, The modal mu-calculus alternation hierarchy is strict. Online via the Web page http://dcs.ed.ac.uk/home/jcb/orbyftp at ftp://ftp, des.ed.ac.uk/export/jcb/Research/althi.ps.gz.
7. E. A. Emerson and C. Jutla. The complelety of tree automata and logics of programs. Extended version from FOGS '88. (1988).
8. E. A. Emerson and C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus. Proc. First IEEE Syrup. on Logic in Computer Science 267-278 (1986).
9. R. Kaivola, On modal mu-calculus and Bfichi tree automata. Inf. Proc. Letters 54 17-22 (1995).
10. D. Kozen, Results on the propositional µ-calculus. Theoret. Comput. Sci. 27 333-354 (1983).
11. G. Lenzi, A hierarchy theorem for the µ-calculus. To appear in Proc. ICALP '96.
12. D. Long, A. Browne, E. Clarke, S. Jha and W. Marrero, An improved algorithm for the evaluation of fixpoint expressions. Proc. CAV '94, LNCS 818 338--350 (1994).
13. R. S. Lubarsky, µ-definable sets of integers, J. Symbolic Logic 58 291-313 (1993).
14. Y. N. Moschovakis, Elementary induction on abstract structures, North-Holland, Amsterdam (1974).
15. D. Niwifiski, On fixed point clones. Proc. 13th ICALP, LNCS 226 464-473 (1986).
16. 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.
17. W. Richter and P. Aczel, Inductive definitions and reflecting properties of admissible ordinals, in Fenstad and Hinman (ed.), Generalized recursion theory, North-Holland, Amsterdam 301-381 (1974).
18. R. S. Streett and E. A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation 81 249-264 (1989).
19. C. Stirling, Local model checking games. Proc. Concur '95, LNCS 962, 1-11 (1995).
20. M. Takashashi, The greatest fixed-points and rational omega-tree languages. Theor. Comput. Sci. 44 259-274 (1986).