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

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

Volumn 1256, Issue , 1997, Pages 419-429

  Burkart, Olaf ^a   Steffen, Bernhard ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; CONTEXT FREE LANGUAGES; SEMANTICS; TEMPORAL LOGIC;

CONTEXT-FREE PROCESS; CORRECTNESS PROOFS; DYNAMIC ENVIRONMENTS; EXPONENTIAL ALGORITHMS; MODAL MU CALCULUS; MODEL CHECKING ALGORITHM; PUSHDOWN PROCESS; SEQUENTIAL PROCESS;

MODEL CHECKING;

EID: 84951123519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_198     Document Type: Conference Paper

References (15)

1. O. Burkart and J. Esparza. More Infinite Results. In INFINITY '96, volume 6 of ENTCS, 23 pages. Elsevier Science B.V., 1997.
2. O. Burkart and Y.-M. Quemener. Model-Checking of Infinite Graphs Defined by Graph Grammars. In INFINITY '96, volume 6 of ENTCS, 15 pages. Elsevier Science B.V., 1997.
3. J.C. Bradfield. The Modal mu-Calculus Alternation Hierarchy is Strict. In CONCUR '96, LNCS 1119, pages 233-246. Springer, 1996.
4. O. Burkart and B. Steffen. Model Checking for Context-Free Processes. In CONCUR '92, LNCS 630, pages 123-137. Springer, 1992.
5. O. Burkart and B. Steffen. Composition, Decomposition and Model-Checking of Pushdown Processes. Nordic Journal of Computing, 2:89-125, 1995.
6. O. Burkart and B. Steffen. Model Checking the Full-Modal Mu-Calculus for Infinite Sequential Processes. Technical Report LFCS-97-355, University of Edinburgh, April 1997.
7. D. Caucal. On Infinite Transition Graphs Having a Decidable Monadic Theory. In W ALP '96, LNCS 1099, pages 194-205. Springer, 1996.
8. R. Cleaveland, M. Klein, and B. Steffen. Faster Model Checking for the Modal Mu-Calculus. In CAV '92, LNCS 663, pages 410-422, 1992.
9. B. Courcelle. Graph Rewriting: An Algebraic and Logic Approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 5, pages 193-242. Elsevier Science Publisher B.V., 1990.
10. H. Hungar and B. Steffen. Local Model-Checking for Context-Free Processes. Nordic Journal of Computing, l(3):364-385, 1994.
11. D. Kozen. Results on the Propositional-Calculus. Theoretical Computer Science, 27:333-354, 1983.
12. D.E. Long, A. Browne, E.M. Clarke, S. Jha, and W.R. Marrero. An Improved Algorithm for the Evaluation of Fixpoint Expressions. In CAV '9Ą, LNCS 818, pages 338-350. Springer, 1994.
13. D.E. Muller and P.E. Schupp. The Theory of Ends, Pushdown Automata, and Second-Order Logic. Theoretical Computer Science, 37:51-75, 1985.
14. R.O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the A MS, 141:1-35, 1969.
15. Walukiewicz. Pushdown Processes: Games and Model-Checking. In CAV '96, LNCS 1102. Springer, 1996.