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

Ranee Cleaveland, Marion Klein, Bernhard Steffen
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
more » ... Mu-Calculus This section first provides a brief overview of labeled transition 8ystents, which are used as models for the mu-calcnlus. Then the syntax and semantics of the logic are developed. Transition Systems Definition 2.1 A labeled transition system T /8 a lr/p/e (,q, Act, --,), where ,q is rt set o/states, Act is a set o/actions, and ---, C 8 • Act • 8 is the transition relation. Intuitively, a labeled transition system encodes the operational behavior of a system. The set 8 represents the set "of states the system may enter, and Act contains the set of actions the system may perform. The relation --, describes the actions available to states and the state transitions that
doi:10.1007/3-540-56496-9_32 fatcat:4rrsehc4zfgyrc7zxsagv5xy34