The modal mu-calculus alternation hierarchy is strict
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 233-246
- https://doi.org/10.1007/3-540-61604-7_58
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On modal mu-calculus and Büchi tree automataInformation Processing Letters, 1995
- Verification of Temporal Properties of Concurrent SystemsDAIMI Report Series, 1993
- μ-definable sets of integersThe Journal of Symbolic Logic, 1993
- An automata theoretic decision procedure for the propositional mu-calculusInformation and Computation, 1989
- The complexity of tree automata and logics of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- The greatest fixed-points and rational omega-tree languagesTheoretical Computer Science, 1986
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Admissible Sets and StructuresPublished by Springer Nature ,1975