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

Arbitrary transition systems and bisimulations

Lax369799.UnrestrictedTransitionSystems · concepts/Lax369799/UnrestrictedTransitionSystems.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

    A pointed transition system may have an arbitrary state space. The usual back-and-forth definition of bisimulation imposes no finiteness or reachability assumption. Finite transition systems embed by retaining their vertices, initial point, edges, and proposition valuations.

    Concept map
    3 concepts; 5 descendants hidden
    100%
    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Lean source view on GitHub

    1import Lax369799.TransitionSystems
    2
    3/-!
    4---
    5title: Arbitrary transition systems and bisimulations
    6type: definition
    7---
    8A pointed transition system may have an arbitrary state space. The usual
    9back-and-forth definition of bisimulation imposes no finiteness or
    10reachability assumption. Finite transition systems embed by retaining
    11their vertices, initial point, edges, and proposition valuations.
    12-/
    13
    14namespace Lax369799.UnrestrictedTransitionSystems
    15
    16structure TransitionSystem (P : Type) where
    17 Vertex : Type
    18 initial : Vertex
    19 edge : Vertex → Vertex → Prop
    20 valuation : Vertex → Set P
    21
    22def ofFinite {P : Type} (S : TransitionSystems.TransitionSystem P) : TransitionSystem P :=
    23 ⟨S.Vertex,S.initial,S.edge,S.valuation⟩
    24
    25def Bisimulation {P : Type} (S T : TransitionSystem P)
    26 (R : S.Vertex → T.Vertex → Prop) : Prop :=
    27 R S.initial T.initial ∧ ∀ v w, R v w →
    28 S.valuation v = T.valuation w ∧
    29 (∀ v', S.edge v v' → ∃ w', T.edge w w' ∧ R v' w') ∧
    30 (∀ w', T.edge w w' → ∃ v', S.edge v v' ∧ R v' w')
    31
    32def Bisimilar {P : Type} (S T : TransitionSystem P) : Prop :=
    33 ∃ R, Bisimulation S T R
    34
    35def BisimulationInvariant {P : Type} (L : Set (TransitionSystem P)) : Prop :=
    36 ∀ S T, Bisimilar S T → (S ∈ L ↔ T ∈ L)
    37
    38end Lax369799.UnrestrictedTransitionSystems
    39
    40
    Builds on
    Used by
    From Mathlib

    none

    Discussion

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

    Loading discussion…