AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Bounded

classimported Lean

An LTS is bounded if there is a global bound on the length of all of its finite executions.

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
class Cslib.LTS.Bounded (lts : LTS State Label)
Defined in
CSLib, `Cslib.LTS.Bounded`
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.
Verified
08 Oct 2026
Axioms
none listed
Built on 4
  • 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.LTS.BoundedUpToAn LTS is bounded up to n if every finite execution has length strictly less than n.
  • 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 2

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 if there is a global bound on the length of all of its finite executions. -/
class Cslib.LTS.Bounded (lts : LTS State Label) where
  bounded : ∃ n, lts.BoundedUpTo n
See it in the graphDiscuss this resultChallenge it