A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Faster model checking for the modal Mu-Calculus
[chapter]

1993
*
Lecture Notes in Computer Science
*

In thla paper, we develop an algorithm for model checking that handlu the full modal mucalculus including alternating fixpoints. Our algorithm has a better worst-cue complexity than the best known algorithm for this logic while performing just u well on certain sublogi~ as other specialized algorithms. Important for the efficiency is an alternative chexacterlsation of formulas in terms of equational systems, which enables the sharing and reals of intermediate results. Syntax and Semantics of

doi:10.1007/3-540-56496-9_32
fatcat:4rrsehc4zfgyrc7zxsagv5xy34