On model-checking for fragments of μ-calculus

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

Volumn 697 LNCS, Issue , 1993, Pages 385-396

  Emerson, E A ^a   Jutla, C S ^b   Sistla, A P ^c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957813927     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-56922-7_32     Document Type: Conference Paper

References (13)

1. R. Cleaveland, Tableux-based model checking in the propositional μ-calculus, Acta Informatica, 27:725-747, 1990.
2. R. Cleaveland and B. Steffen, A linear-time model-checking for alternation free modal fi-calculus, Proceedings of the 3rd workshop on Computer Aided Verification, Aalborg, LNCS, Springer-Verlag, July 1991.
3. R. Cleaveland and B. Steffen, Faster model-checking for modal μ-calculus, Proceedings of the 4th workshop on Computer Aided Verification, Montreal, July 1991.
4. E. A. Emerson, E. M. Clarke, Characterizing correctness properties of parallel programs Using Fixpoints, Proceedings of the International Conference on Automata, Languages and Programming, 1980.
5. E.A. Emerson and C. S. Jutla, Tree Automata, Mu-calculus and Determinacy, Proceedings of the 1991 IEEE Symposium on Foundations of Computer Science.
6. E. A Emerson and C. Leis, Efficient model-checking in fragments of μ-calculus, Proceedings of Symposium on Logic in Computer Science, 1986.
7. E. A. Emerson and C. Leis, Modalities for Model Checking, Science of Computer Programming, 1987.
8. D. Kozen, Results on the propositional μ-calculus, Theoretical Computer Science, 27, 1983.
9. A.W. Mostowski, Regular Expressions for Infinite trees and a standard form of automata, in: A. Skowron, ed., Computation Theory, LNCS, vol 208, 1984, Springer-Verlag.
10. D. Niwinski, Fixed-points Vs. Infinite Generation, Proceedings of the Third IEEE Symposium on Logic in Computer Science, 1988.
11. C. Stirling, D. Walker, Local model-checking in modal μ-calculus, Proceedings of TAPSOFT, 1989.
12. R. S. Streett and E. A. Emerson, An automata theoretic decision procedure for Propositional μ-calculus, Proceedings of the International Conference on Automata, Languages and Programming, 1984.
13. M. Vardi and P. Wolper, Yet Another Process Logic, Proceedings of the workshop on Logics of Programs, Pittsburgh, 1983, also appeared in Lecture Notes in Computer Science.