Cslib.LTS.Relation.toLTS
defimported Lean
Any homogeneous relation can be seen as an LTS where all transitions have the same label.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in def Cslib.LTS.Relation.toLTS [DecidableEq Label] (r : State → State → Prop) (μ : Label) : LTS State Label
- Defined in
- CSLib, `Cslib.LTS.Relation.toLTS`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Fabrizio Montesi. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.Cslib.LTS.Relation.toLTS← Cslib.LTS.Relation.toLTS (Cslib/Foundations/Semantics/LTS/Relation.lean:26): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 1
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in /-- Any homogeneous relation can be seen as an LTS where all transitions have the same label. -/ def Cslib.LTS.Relation.toLTS [DecidableEq Label] (r : State → State → Prop) (μ : Label) : LTS State Label where Tr := fun s1 μ' s2 => if μ' = μ then r s1 s2 else False