The modal mu-calculus alternation hierarchy is strict
- 30 March 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 195 (2) , 133-153
- https://doi.org/10.1016/s0304-3975(97)00217-x
Abstract
No abstract availableKeywords
This publication has 7 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
- A finite model theorem for the propositional ?-calculusStudia Logica, 1988
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Weakly Definable Relations and Special AutomataPublished by Elsevier ,1970