Model checking the full modal mu-calculus for infinite sequential processes
Authors:
- 1 January 1997
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 419-429
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Model checking the full modal mu-calculus for infinite sequential processesLecture Notes in Computer Science, 1997
- Model-Checking of Infinite Graphs Defined by Graph GrammarsElectronic Notes in Theoretical Computer Science, 1997
- The modal mu-calculus alternation hierarchy is strict1996
- Pushdown processes: Games and model checking1996
- On infinite transition graphs having a decidable monadic theory1996
- An improved algorithm for the evaluation of fixpoint expressionsLecture Notes in Computer Science, 1994
- Graph Rewriting: An Algebraic and Logic Approach1990
- The theory of ends, pushdown automata, and second-order logicTheoretical Computer Science, 1985
- Results on the propositional μ-calculusTheoretical Computer Science, 1983