Model checking the full modal mu-calculu
✍
Olaf Burkart; Bernhard Steffen
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 983 KB
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