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

This publication has 10 references indexed in Scilit:

• Model checking for context-free processes
  Published by Springer Nature ,2006
• Model-Checking of Infinite Graphs Defined by Graph Grammars
  Electronic Notes in Theoretical Computer Science, 1997
• Model checking the full modal mu-calculus for infinite sequential processes
  Published by Springer Nature ,1997
• The modal mu-calculus alternation hierarchy is strict
  Published by Springer Nature ,1996
• Pushdown processes: Games and model checking
  Published by Springer Nature ,1996
• On infinite transition graphs having a decidable monadic theory
  Published by Springer Nature ,1996
• An improved algorithm for the evaluation of fixpoint expressions
  Published by Springer Nature ,1994
• Graph Rewriting: An Algebraic and Logic Approach
  Published by Elsevier ,1990
• The theory of ends, pushdown automata, and second-order logic
  Theoretical Computer Science, 1985
• Results on the propositional μ-calculus
  Theoretical Computer Science, 1983