Cslib.LTS.BoundedUpTo
defimported Lean
An LTS is bounded up to n if every finite execution has length strictly less than n.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in def Cslib.LTS.BoundedUpTo (lts : LTS State Label) (n : ℕ) : Prop
- Defined in
- CSLib, `Cslib.LTS.BoundedUpTo`
- 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.BoundedUpTo← Cslib.LTS.BoundedUpTo (Cslib/Foundations/Semantics/LTS/Basic.lean:368): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 4
- Cslib.LTS.MTrDefinition of a multistep transition. (Implementation note: compared to [Montesi2023], we choose stepL instead of stepR as fundamental…
- Cslib.LTS.MTr.nil_iffCslib.LTS.MTr.nil_iff
- Cslib.LTS.MTr.singleton_iffA 1-sized multistep transition is exactly a single transition with the given label.
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
State) and a type of transition labels (Label) consists of a labelled…
- Used by 4
- Cslib.LTS.Acyclic.toBoundedUpToOn a finite state space, an acyclic LTS has execution length strictly less than the number of states.
- Cslib.LTS.Acyclic.toBoundedOn a finite state space, acyclic LTSs are bounded.
- Cslib.LTS.Example.countdownLTS_not_boundedThe countdown LTS is not bounded.
- Cslib.LTS.BoundedAn LTS is bounded if there is a global bound on the length of all of its finite executions.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib Cslib.LTS in universe u v in variable {State : Type u} {Label : Type v} (lts : LTS State Label) in /-- An LTS is bounded up to `n` if every finite execution has length strictly less than `n`. -/ def Cslib.LTS.BoundedUpTo (lts : LTS State Label) (n : ℕ) : Prop := ∀ s1 μs s2, lts.MTr s1 μs s2 → μs.length < n