While this submission is a draft, it cannot be used by other submissions.

Modal mu-calculus

Lax369799.ModalMuCalculus · concepts/Lax369799/ModalMuCalculus.lean · lax-369799

definition

Loading review…

Sign in with ORCID

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Natural Language Statement

    Definition

    The modal mu-calculus is presented in negation normal form: negation is allowed on proposition letters, and all fixed-point variables occur positively. Formulas have conjunction, disjunction, box, diamond, and least and greatest fixed points. A binder introduces variable zero and shifts the previous free variables. Least fixed points are intersections of pre-fixed points; greatest fixed points are unions of post-fixed points. A closed formula is evaluated at the initial vertex.

    Concept map
    3 concepts
    100%
    DefinitionThis conceptRelated conceptA → B: B builds on ADescendants are omitted for concepts with more than 10 descendants.

    Lean source view on GitHub

    1import Lax369799.TransitionSystems
    2import Mathlib.Order.CompleteLattice.Basic
    3
    4/-!
    5---
    6title: Modal mu-calculus
    7type: definition
    8---
    9The modal mu-calculus is presented in negation normal form: negation is
    10allowed on proposition letters, and all fixed-point variables occur
    11positively. Formulas have conjunction, disjunction, box, diamond, and least
    12and greatest fixed points. A binder introduces variable zero and shifts
    13the previous free variables. Least fixed points are intersections of
    14pre-fixed points; greatest fixed points are unions of post-fixed points.
    15A closed formula is evaluated at the initial vertex.
    16-/
    17
    18namespace Lax369799.ModalMuCalculus
    19open TransitionSystems
    20
    21inductive Formula (P : Type) : ℕ → Type
    22 | top {n} : Formula P n
    23 | bot {n} : Formula P n
    24 | proposition {n} : P → Formula P n
    25 | negProposition {n} : P → Formula P n
    26 | variable {n} : Fin n → Formula P n
    27 | conj {n} : Formula P n → Formula P n → Formula P n
    28 | disj {n} : Formula P n → Formula P n → Formula P n
    29 | diamond {n} : Formula P n → Formula P n
    30 | box {n} : Formula P n → Formula P n
    31 | mu {n} : Formula P (n + 1) → Formula P n
    32 | nu {n} : Formula P (n + 1) → Formula P n
    33
    34def Formula.eval {P : Type} (S : TransitionSystem P) :
    35 {n : ℕ} → Formula P n → (Fin n → Set S.Vertex) → Set S.Vertex
    36 | _, .top, _ => Set.univ
    37 | _, .bot, _ => ∅
    38 | _, .proposition p, _ => {v | p ∈ S.valuation v}
    39 | _, .negProposition p, _ => {v | p ∉ S.valuation v}
    40 | _, .variable x, ρ => ρ x
    41 | _, .conj φ ψ, ρ => φ.eval S ρ ∩ ψ.eval S ρ
    42 | _, .disj φ ψ, ρ => φ.eval S ρ ∪ ψ.eval S ρ
    43 | _, .diamond φ, ρ => {v | ∃ w, S.edge v w ∧ w ∈ φ.eval S ρ}
    44 | _, .box φ, ρ => {v | ∀ w, S.edge v w → w ∈ φ.eval S ρ}
    45 | _, .mu φ, ρ => sInf {X | φ.eval S (Fin.cases X ρ) ⊆ X}
    46 | _, .nu φ, ρ => sSup {X | X ⊆ φ.eval S (Fin.cases X ρ)}
    47
    48abbrev Sentence (P : Type) := Formula P 0
    49
    50def Models {P : Type} (S : TransitionSystem P) (φ : Sentence P) : Prop :=
    51 S.initial ∈ φ.eval S Fin.elim0
    52
    53def Definable {P : Type} (L : Set (TransitionSystem P)) : Prop :=
    54 ∃ φ : Sentence P, ∀ S, S ∈ L ↔ Models S φ
    55
    56end Lax369799.ModalMuCalculus
    57

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above.

    Loading discussion…