Modal μ-calculus

In theoretical computer science, the modal μ-calculus (Lμ, L_μ, sometimes just μ-calculus, although this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint operator $\nu$, thus a fixed-point logic.

The (propositional, modal) μ-calculus originates with Dana Scott and Jaco de Bakker,^[1] and was further developed by Dexter Kozen into the version most used nowadays. It is used to describe properties of labelled transition systems and for verifying these properties. Many temporal logics can be encoded in the μ-calculus, including CTL* and its widely used fragments—linear temporal logic and computational tree logic.^[2]

An algebraic view is to see it as an algebra of monotonic functions over a complete lattice, with operators consisting of functional composition plus the least and greatest fixed point operators; from this viewpoint, the modal μ-calculus is over the lattice of a power set algebra.^[3] The game semantics of μ-calculus is related to two-player games with perfect information, particularly infinite parity games.^[4]

Syntax

Let P (propositions) and A (actions) be two finite sets of symbols, and let V be a countably infinite set of variables. The set of formulas of (propositional, modal) μ-calculus is defined as follows:

• each proposition and each variable is a formula;
• if $\phi$ and $\psi$ are formulas, then $\phi \wedge \psi$ is a formula.
• if $\phi$ is a formula, then $\neg \phi$ is a formula;
• if $\phi$ is a formula and $a$ is an action, then $[a] \phi$ is a formula;(pronounced either: $a$ box $\phi$ or after $a$ necessarily $\phi$)
• if $\phi$ is a formula and $Z$ a variable, then $\nu Z. \phi$ is a formula, provided that every free occurrence of $Z$ in $\phi$ occurs positively, i.e. within the scope of an even number of negations.

(The notions of free and bound variables are as usual, where $\nu$ is the only binding operator.)

Given the above definitions, we can enrich the syntax with:

• $\phi \lor \psi$ meaning $\neg (\neg \phi \land \neg \psi)$
• $\langle a \rangle \phi$ (pronounced either: $a$ diamond $\phi$ or after $a$ possibly $\phi$) meaning $\neg [a] \neg \phi$
• $\mu Z. \phi$ means $\neg \nu Z. \neg \phi [Z:=\neg Z]$, where $\phi [Z:=\neg Z]$ means substituting $\neg Z$ for Z in all free occurrences of Z in $\phi$.

The first two formulas are the familiar ones from the classical propositional calculus and respectively the minimal multimodal logic K.

The notation $\mu Z. \phi$ (and its dual) are inspired from the lambda calculus; the intent is to denote the least (and respectively greatest) fixed point of the expression $\phi$ where the "minimization" (and respectively "maximization") are in the variable Z, much like in lambda calculus $\lambda Z. \phi$ is a function with formula $\phi$ in bound variable Z;^[5] see the denotational semantics below for details.

Denotational semantics

Models of (propositional) μ-calculus are given as labelled transition systems $(S, R, V)$ where:

• $S$ is a set of states;
• $R$ maps to each label $a$ a relation on $S$;
• $V : \mbox{Var} \rightarrow 2^S$, maps to each proposition $p \in \mbox{Prop}$ the set of states where the proposition is true.

Given a labelled transition system $(S, R, V)$ and an interpretation $i$ of the formulas $\phi$ of $\mu$-calculus, $[\![\underline{~\,}]\!]_i : \phi \rightarrow 2^S$, is the function defined by the following rules:

• $[\![p]\!]_i = V(p)$;
• $[\![Z]\!]_i = i(Z)$;
• $[\![\phi \wedge \psi]\!]_i = [\![\phi]\!]_i \cap [\![\psi]\!]_i$;
• $[\![\neg \phi]\!]_i = S \smallsetminus [\![\phi]\!]_i$;
• $[\![[a] \phi]\!]_i = \{s \in S \mid \forall t \in S, (s, t) \in R_a \rightarrow t \in [\![\phi]\!]_i\}$;
• $[\![\nu Z. \phi]\!]_i = \bigcup \{T \subseteq S \mid T \subseteq [\![\phi]\!]_{i[Z := T]}\}$, where $i[Z := T]$ maps Z to T while preserving the mappings of $i$ everywhere else.

By duality, the interpretation of the other basic formulas is:

• $[\![\phi \vee \psi]\!]_i = [\![\phi]\!]_i \cup [\![\psi]\!]_i$;
• $[\![\langle a \rangle \phi]\!]_i = \{s \in S \mid \exists t \in S, (s, t) \in R_a \wedge t \in [\![\phi]\!]_i\}$;
• $[\![\mu Z. \phi]\!]_i = \bigcap \{T \subseteq S \mid [\![\phi]\!]_{i[Z := T]} \subseteq T \}$

Less formally, this means that, for a given transition system $(S, R, V)$:

• $p$ holds in the set of states $V(p)$;
• $\phi \wedge \psi$ holds in every state where $\phi$ and $\psi$ both hold;
• $\neg \phi$ holds in every state where $\phi$ does not hold.
• $[a] \phi$ holds in a state $s$ if every $a$-transition leading out of $s$ leads to a state where $\phi$ holds.
• $\langle a\rangle \phi$ holds in a state $s$ if there exists $a$-transition leading out of $s$ that leads to a state where $\phi$ holds.
• $\nu Z.\phi$ holds in any state in any set $T$ such that, when the variable $Z$ is set to $T$, then $\phi$ holds for all of $T$. (From the Knaster–Tarski theorem it follows that $[\![\nu Z.\phi]\!]_i$ is the greatest fixpoint of $[\![\phi]\!]_{i[Z := T]}$, and $[\![\mu Z. \phi]\!]_i$ its least fixpoint.)

The interpretations of $[a] \phi$ and $\langle a\rangle \phi$ are if fact the "classical" ones from dynamic logic. Additionally, the operator μ can be interpreted as liveness ("something good eventually happens") and ν as safety ("nothing bad ever happens") in Leslie Lamport's informal classification.^[6]

Examples

• $\nu Z.\phi \wedge [a]Z$ is interpreted as "$\phi$ is true along every a-path".^[6]
• $\mu Z.\phi \vee \langle a \rangle Z$ is interpreted as the existence of a path along a-transitions to a state where $\phi$ holds.^[7]
• The property of a system of being deadlock-free, understood as having no states without outgoing transitions and furthermore there does not exists a path to such a state, is expressed by formula^[7]

  $\nu Z.(\bigvee_{a\in A}\langle a\rangle\top\wedge \bigwedge_{a\in A}[a]Z)$

Satisfiability

Satisfiability of a modal μ-calculus formula is EXPTIME-complete.^[8]

See also

• Finite model theory
• Alternation-free modal μ-calculus

Notes

1. Kozen p. 333.
2. Clarke p.108, Theorem 6; Emerson p. 196
3. Arnold and Niwiński, pp. viii-x and chapter 6
4. Arnold and Niwiński, pp. viii-x and chapter 4
5. Arnold and Niwiński, p. 14
6. Bradfield and Stirling, p. 731
7. Erich Grädel; Phokion G. Kolaitis; Leonid Libkin; Maarten Marx; Joel Spencer; Moshe Y. Vardi; Yde Venema; Scott Weinstein (2007). Finite Model Theory and Its Applications. Springer. p. 159. ISBN 978-3-540-00428-8.
8. Klaus Schneider (2004). Verification of reactive systems: formal methods and algorithms. Springer. p. 521. ISBN 978-3-540-00296-3.

References

• Clarke, Jr., Edmund M.; Orna Grumberg; Doron A. Peled (1999). Model Checking. Cambridge, Massachusetts, USA: MIT press. ISBN 0-262-03270-8., chapter 7, Model checking for the μ-calculus, pp. 97–108
• Stirling, Colin. (2001). Modal and Temporal Properties of Processes. New York, Berlin, Heidelberg: Springer Verlag. ISBN 0-387-98717-7., chapter 5, Modal μ-calculus, pp. 103–128
• André Arnold; Damian Niwiński (2001). Rudiments of μ-Calculus. Elsevier. ISBN 978-0-444-50620-7., chapter 6, The μ-calculus over powerset algebras, pp. 141–153 is about the modal μ-calculus
• Yde Venema (2008) Lectures on the Modal μ-calculus; was presented at The 18th European Summer School in Logic, Language and Information
• Bradfield, Julian and Stirling, Colin (2006). "Modal mu-calculi". In P. Blackburn, J. van Benthem and F. Wolter (eds.). The Handbook of Modal Logic. Elsevier. pp. 721–756.
• Emerson, E. Allen (1996). "Model Checking and the Mu-calculus". Descriptive Complexity and Finite Models. American Mathematical Society. pp. 185–214. ISBN 0-8218-0517-7.
• Kozen, Dexter (1983). "Results on the Propositional μ-Calculus". Theoretical Computer Science 27 (3): 333–354. doi:10.1016/0304-3975(82)90125-6.

External links

• Sophie Pinchinat, Logic, Automata & Games video recording of a lecture at ANU Logic Summer School '09