Model Checking Games for the Quantitativeμ-Calculus
✍ Scribed by Diana Fischer; Erich Grädel; Łukasz Kaiser
- Publisher
- Springer
- Year
- 2009
- Tongue
- English
- Weight
- 675 KB
- Volume
- 47
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this work we extend the approach used in [6] to perform distributed-memory AFMC model checking. The part of a system held in one computer is modeled as a Kripke structure with border states. Moreover, we use assumptions about the truth of a formula in each state. Each process then repeatedly exec
It is known that pushdown processes have a decidable monadic second-order theory (Muller and Schupp, Theoret. Comput. Sci. 37 (1985) 51-75) and that this result covers the model-checking problem for the modal mu-calculus. Unfortunately, the corresponding decidability procedure is not practical due t