A hierarchy theorem for the μ-calculus

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

Volumn 1099, Issue , 1996, Pages 87-97

  Lenzi, Giacomo ^a  

^a SCUOLA NORMALE SUPERIORE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS;

EMERSON; MODAL MU CALCULUS; MU-CALCULUS; SUBLANGUAGES;

TEMPORAL LOGIC;

EID: 84947755850     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61440-0_119     Document Type: Conference Paper

References (14)

1. Bradfield, J. C: The modal mu-calculus alternation hierarchy is strict. Manuscript, 1995.
2. Clarke, E. M., Emerson, E. A.: Design and synthesis of synchronization skeletons using Branching Time Temporal Logic. Proc. Workshop on Logics of Programs, Lecture Notes in Computer Science 131, 1981, pp. 52-71.
3. Emerson, E. A.: Temporal and Modal Logic. In Handbook of Theoretical Computer Science vol. B (J. van Leeuwen, ed.), North-Holland, 1990, pp. 995-1072.
4. Emerson, E. A., Halpern, J.: "Sometimes" and "Not never" revisited: on Branching versus Linear Time Temporal Logic. Journal of the ACM 33, 1986, pp. 151-178.
5. Emerson, E. A., Jutla, C: The complexity of tree automata and logics of programs. Extended version from FOCS '88, 1988.
6. Emerson, E. A., Lei, C. L.: Efficient model checking in fragments of the prepositional mu-calculus. Proc. First IEEE Symp. on Logic in Computer Science, 1986, pp. 267-278.
7. Emerson, E. A., Streett, R.: An automata-theoretic decision procedure for the propositional mu-calculus. Information and Computation 81, 3, 1989, pp. 249-264.
8. Fischer, M, Ladner, R.: Propositional Dynamic Logic of regular programs. JCSS 18, 1979, pp. 194-211.
9. Kozen, D.: Results on the propositional mu-calculus. Theoretical Computer Science 27, 1983, pp. 333-354.
10. Kaivola, R.: On modal mu-calculus and Biichi tree automata. Inf. Proc. Letters 54, 1995, pp. 17-22.
11. Niwiński, D.: On fixed point clones. Proc. 13th ICALP, Lecture Notes in Computer Science 226, 1986, pp. 464-473.
12. Pnueli, A.: The temporal logic of programs. 18th IEEE Symp. on Foundations of Computer Science, 1977, pp. 46-57.
13. Pratt, V.: A decidable mu-calculus. 22nd IEEE Symp. on Foundations of Computer Science, 1981, pp. 421-427.
14. Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 55, 1955, pp. 285-309.