Cslib.LTSCat
structureimported Lean
The definition of labelled transition system (with the type of states and the type of labels as part of the structure).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {State Label : Type*} in set_option linter.checkUnivs false in structure Cslib.LTSCat : Type (max u v + 1)
- Defined in
- CSLib, `Cslib.LTSCat`
- 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.LTSCat← Cslib.LTSCat (Cslib/Foundations/Semantics/LTS/LTSCat/Basic.lean:43): 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 4
- Cslib.LTS.Morphism.idThe identity LTS morphism.
- 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 set_option linter.checkUnivs false in /-- The definition of labelled transition system (with the type of states and the type of labels as part of the structure). -/ structure Cslib.LTSCat : Type (max u v + 1) where /-- Type of states of an LTS -/ State : Type u /-- Type of labels of an LTS -/ Label : Type v /-- Transition relation of an LTS -/ lts : LTS State Label