AFTD Auto-Formalizing Theoretical Domains

Cslib.LTS.totalize

defimported Lean

totalize constructs a total LTS from any given LTS by adding a sink state.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib in
variable {State Label : Type*} {lts : LTS State Label} in
def Cslib.LTS.totalize (lts : LTS State Label) : LTS (Option State) Label
Defined in
CSLib, `Cslib.LTS.totalize`
Lean proof
By Ching-Tsun Chou, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Ching-Tsun Chou. 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 1
  • 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 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib in
variable {State Label : Type*} {lts : LTS State Label} in
/-- `totalize` constructs a total LTS from any given LTS by adding a sink state. -/
def Cslib.LTS.totalize (lts : LTS State Label) : LTS (Option State) Label where
  Tr s' μ t' := match s', t' with
    | some s, some t => lts.Tr s μ t
    | _, none => True
    | none, some _ => False
See it in the graphDiscuss this resultChallenge it