Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes

@inproceedings{Burkart1997ModelCT,
  title={Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes},
  author={Olaf Burkart and Bernhard Steffen},
  booktitle={ICALP},
  year={1997}
}
In this paper we develop a new elementary algorithm for model-checking infinite sequential processes, including context-free processes, pushdown processes, and regular graphs, that decides the full modal mu-calculus. Whereas the actual model checking algorithm results from considering conditional semantics together with backtracking caused by alternation, the corresponding correctness proof requires a stronger framework, which uses dynamic environments modelled by finite-state automata. 

3 Figures & Tables

Topics

Statistics

051015'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

85 Citations

Semantic Scholar estimates that this publication has 85 citations based on the available data.

See our FAQ for additional information.