Model checking the full modal mu-calculus for infinite sequential processes

Theoretical Computer Science

Volumn 221, Issue 1-2, 1999, Pages 251-270

  Burkart, Olaf ^a,c   Steffen, Bernhard ^b,c  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF PASSAU   (Germany)

^c TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Context free processes; Infinite state systems; Modal mu calculus; Model checking; Pushdown processes; Regular graphs

Indexed keywords

EID: 0042499501     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00034-1     Document Type: Article

References (18)

1. O. Burkart, J. Esparza, More infinite results, INFINITY '96, ENTCS, vol. 6, Elsevier, Amsterdam, 1997, 23 pp.
2. O. Burkart, Y.-M. Quemener, Model-checking of infinite graphs defined by graph grammars, INFINITY '96, ENTCS, vol. 6, Elsevier, Amsterdam, 1997, 15 pp.
3. J.C. Bradfield, The modal mu-calculus alternation hierarchy is strict, CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 233-246.
4. O. Burkart, B. Steffen, Model checking for context-free processes, CONCUR '92, Lecture Notes in Computer Science, vol. 630, Springer, Berlin, 1992, pp. 123-137.
5. O. Burkart, B. Steffen, Composition, decomposition and model-checking of pushdown processes, Nordic J. Comput. 2 (1995) 89-125.
6. O. Burkart, Model-checking rationally restricted right closures of recognizable graphs, INFINITY '97, UPMAIL Tech. Report 148, Uppsala, July 1997, pp. 19-29.
7. D. Caucal, On infinite transition graphs having a decidable monadic theory, ICALP '96, Lecture Notes in Computer Science, vol. 1099, Springer, Berlin, 1996, pp. 194-205.
8. R. Cleaveland, M. Klein, B. Steffen, Faster model checking for the modal mu-calculus, CAV '92, Lecture Notes in Computer Science, vol. 663, 1992, pp. 410-422.
9. B. Courcelle, Graph rewriting: an algebraic and logic approach, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Ch. 5, Elsevier, Amsterdam, 1990, pp. 193-242.
10. J. Esparza, A. Kiehn, On the model checking problem for branching time logics and basic parallel processes, CAV '95, Lecture Notes in Computer Science, vol. 939, Springer, Berlin, 1995, pp. 353-366.
11. J. Esparza, On the decidability of model checking for several μ-calculi and petri nets, CAAP '94, Lecture Notes in Computer Science, vol. 787, Springer, Berlin, 1994, pp. 115-129.
12. H. Hungar, B. Steffen, Local model-checking for context-free processes, Nordic J. Comput. 1 (3) (1994) 364-385.
13. D. Janin, I. Walukiewicz, On the expressive completeness of the propositional mu-calculus wrt monadic second order logic, CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 263-277.
14. D. Kozen, Results on the propositional μ-calculus, Theoret. Comput. Sci. 27 (1983) 333-354.
15. D.E. Long, A. Browne, E.M. Clarke, S. Jha, W.R. Marrero, An improved algorithm for the evaluation of fixpoint expressions, CAV '94, Lecture Notes in Computer Science, vol. 818, Springer, Berlin, 1994, pp. 338-350.
16. D.E. Muller, P.E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoret. Comput. Sci. 37 (1985) 51-75.
17. R.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. AMS 141 (1969) 1-35.
18. I. Walukiewicz, Pushdown processes: games and model-checking, CAV '96, Lecture Notes in Computer Science, vol. 1102, Springer, Berlin, 1996, pp. 62-74.