The modal mu-calculus alternation hierarchy is strict

Theoretical Computer Science

Volumn 195, Issue 2, 1998, Pages 133-153

  Bradfield, J C ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Expressivity; Fixpoints; mu Calculus; Temporal logic

Indexed keywords

EID: 0003135879     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00217-X     Document Type: Article

References (24)

1. H.R. Andersen, Verification of Temporal Properties of Concurrent Systems, DAIMI PB-445, Computer Science Dept, Aarhus University, 1993.
2. A. Arnold, D. Niwinski, Fixed point characterization of Büchi automata on infinite trees, J. Inform. Process. Cybernet. EIK 26 (1990) 451-459.
3. J. Barwisc, Admissible Sets and Structures, Springer, Berlin, 1975.
4. H. Bekič, Definable operations in general algebras, and the theory of automata and flow charts, in: C.B. Jones (Ed.), Programming Languages and their Definition, Lecture Notes in Computer Science, vol. 177, Springer, Berlin, 1984.
5. J.C. Bradfield, Verifying Temporal Properties of Systems, Birkhäuser, Boston, 1991.
6. J.C. Bradfield, On the expressivity of the modal mu-calculus, in: C. Puech, R. Reischuk (Eds.), Proc. STACS '96. Lecture Notes in Computer Science, vol. 1046, Springer, Berlin, 1996, pp. 479-490.
7. J.C. Bradfield, The modal mu-calculus alternation hierarchy is strict. in: U. Montanari, V. Sassone, (Eds.), Proc. CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer. Berlin, 1996, pp. 233-246.
8. E.A. Emerson, C. Jutla, A.P. Sistla, On model-checking for fragments of μ-calculus, in: C. Courcoubetis (Ed.), Proc. CAV '93, Lecture Notes in Computer Science. vol. 697, Springer. Berlin, 1993, pp. 385-396.
9. E.A. Emerson, C.-L. Lei, Efficient model checking in fragments of the propositional mu-calculus, in: Proc. 1st LICS, IEEE, Los Alamitos, CA, 1986, pp. 267-278.
10. R. Kaivola, On modal mu-calculus and Büchi tree automata, Inform. Process. Lett. 54 (1995) 17-22.
11. D. Kozen, Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
12. D. Kozen, A finite model theorem for the propositional μ-calculus, Studia Logica 47 (1988) 233-241.
13. G. Lenzi, A hierarchy theorem for the mu-calculus, in: F. Meyer auf der Heide, B. Monien (Eds.), Proc. ICALP '96, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 87-109.
14. D. Long, A. Browne, K. Clarke, S. Jha, W. Marrero, An improved algorithm for the evaluation of fixpoint expressions, in: D.L. Dill (Ed.), Proc. CAV '94, Lecture Notes in Computer Science, vol. 818, Springer, Berlin, 1994, pp. 338-350.
15. R.S. Lubarsky, μ-definable sets of integers, J. Symbolic Logic 58 (1993) 291-313.
16. R.S. Lubarsky, personal communication, 1997.
17. A. Mader, Verification of modal properties using boolean equation systems. Doctoral Dissertation, Institut für Informatik, Technische Universität München, 1996.
18. Y.N. Moschovakis, Elementary Induction on Abstract Structures, North-Holland, Amsterdam, 1974.
19. D. Niwiński, On fixed point clones, in: L. Kott (Ed.), Proc. 13th ICALP, Lecture Notes in Computer Science, vol. 226, Springer, Berlin, 1986, pp. 464-473.
20. 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, pp. 1-23.
21. W. Richter, P. Aczel, Inductive definitions and reflecting properties of admissible ordinals, in: J.E. Fenstad, P.O. Hinman (Eds.), Generalized Recursion Theory, North-Holland, Amsterdam, 1974, pp. 301-381.
22. C. Stirling, Local model checking games, in: I. Lee, S.A. Smolka (Eds.), Proc. Concur '95, Lecture Notes in Computer Science, vol. 962, Springer, Berlin, 1995, pp. 1-11.
23. C.P. Stirling, Modal and temporal logics, in: S. Abramsky, D. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Oxford University Press, Oxford, 1991, pp. 477-563.
24. R.S. Streett, E.A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus. Inform, and Comput. 81 (1989) 249-264.