AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.Acyclic

classimported Lean

An LTS is acyclic if its underlying unlabelled transition relation contains no nonempty cycle.

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.Acyclic (lts : LTS State Label)
Defined in
CSLib, `Cslib.LTS.Acyclic`
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 3
  • Cslib.LTSA Labelled Transition System (LTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled…
  • Relation.AcyclicA relation is acyclic if its transitive closure is irreflexive, equivalently if it admits no nonempty cycle.
  • Cslib.LTS.UnlabelledTrThe unlabelled transition relation underlying an LTS.
Used by 4

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 acyclic if its underlying unlabelled transition relation contains no nonempty cycle. -/
class Cslib.LTS.Acyclic (lts : LTS State Label) where
  [acyclic : Relation.Acyclic lts.UnlabelledTr]

attribute [instance] Cslib.LTS.Acyclic.acyclic
See it in the graphDiscuss this resultChallenge it