Cslib.LTS.UnlabelledTr
defimported Lean
The unlabelled transition relation underlying an LTS.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v in def Cslib.LTS.UnlabelledTr (lts : LTS State Label) : State → State → Prop
- Defined in
- CSLib, `Cslib.LTS.UnlabelledTr`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 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.UnlabelledTr← Cslib.LTS.UnlabelledTr (Cslib/Foundations/Semantics/LTS/Basic.lean:71): 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 12
- Cslib.LTS.Example.successorLTS_transGen_ltCslib.LTS.Example.successorLTS_transGen_lt
- Cslib.LTS.transGen_unlabelledTr_iffThe transitive closure of the underlying unlabelled transition relation is exactly the nonempty multistep transitions of the LTS.
- Cslib.LTS.Acyclic.toBoundedUpToOn a finite state space, an acyclic LTS has execution length strictly less than the number of states.
- Cslib.LTS.TerminatingAn LTS is terminating if its underlying unlabelled transition relation is terminating, equivalently if it admits no infinite execution.
- Cslib.LTS.reflTransGen_unlabelledTr_iffThe reflexive-transitive closure of the underlying unlabelled transition relation is exactly reachability in the LTS.
- Cslib.LTS.Execution.isChainThe states visited by an execution form a chain in the underlying unlabelled relation.
- Cslib.LTS.Example.selfLoopLTS_not_acyclicThe self-loop LTS is not acyclic.
- Cslib.LTS.MTr.toTransGenA nonempty multistep transition induces a nonempty path in the underlying unlabelled transition relation.
- Cslib.LTS.Example.countdownLTS_terminatingCslib.LTS.Example.countdownLTS_terminating
- Cslib.LTS.AcyclicAn LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.
- Cslib.LTS.MTr.toReflTransGenA multistep transition induces a reflexive-transitive path in the underlying unlabelled transition relation.
- Cslib.LTS.Example.successorLTS_acyclicCslib.LTS.Example.successorLTS_acyclic
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v in /-- The unlabelled transition relation underlying an LTS. -/ def Cslib.LTS.UnlabelledTr (lts : LTS State Label) : State → State → Prop := fun s1 s2 => ∃ μ, lts.Tr s1 μ s2