Mu-Calculus Model Checking

The Mu-Calculus [Par74] is a logic based on extremal fixed points that is strictly more expressive than CTL,1 and can also express a variety of properties of transition systems, such as reachable state sets, state equivalence relations, and language containment between automata. A symbolic model checking algorithm for this logic allows all of these properties to be computed using OBDDs [BCM+90].