Cslib.LTS.withIdle
defimported Lean
We first define what is denoted Tran* in [WinskelNielsen1995]: the extension of a transition relation with idle transitions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in def Cslib.LTS.withIdle (lts : LTS State Label) : LTS State (Option Label)
- Defined in
- CSLib, `Cslib.LTS.withIdle`
- Lean proof
- By Ayberk Tosun, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 Ayberk Tosun (Zeroth Research). 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.withIdle← Cslib.LTS.withIdle (Cslib/Foundations/Semantics/LTS/LTSCat/Basic.lean:33): 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 (
- Used by 3
- Cslib.LTS.Morphism.compComposition of LTS morphisms. We use Kleisli composition to define this.
- Cslib.instCategoryLTSCatFinally, we prove that these form a category.
- Cslib.LTS.MorphismA morphism between two labelled transition systems consists of (1) a function on states, (2) a partial function on labels, and a proof…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in /-- We first define what is denoted Tran* in [WinskelNielsen1995]: the extension of a transition relation with idle transitions. -/ def Cslib.LTS.withIdle (lts : LTS State Label) : LTS State (Option Label) := ⟨fun s l s' => l.elim (s = s') (lts.Tr s · s')⟩