Cslib.FLTS
structureimported Lean
A Functional Labelled Transition System (FLTS) for a type of states (State) and a type of transition labels (Label) consists of a labelled transition function (tr).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in structure Cslib.FLTS (State Label : Type*)
- Defined in
- CSLib, `Cslib.FLTS`
- 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.FLTS← Cslib.FLTS (Cslib/Foundations/Semantics/FLTS/Basic.lean:32): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 20
- Cslib.Automata.DA.FinAcc.instAcceptorA
DA.FinAccaccepts a string if its multistep transition function maps the start state and the string to an accept state. This is the… - Cslib.FLTS.prod_mtr_eqA state is reachable by the product FLTS iff its components are reachable by the respective FLTS components.
- Cslib.Automata.DA.prod_mtr_eqA state is reachable by the product automaton iff its components are reachable by the respective automaton components.
- Cslib.LTS.Total.chooseFLTSThe FLTS chosen by
chooseFLTSalways provides legal transitions. - Cslib.RightCongruence.toDAEvery right congruence gives rise to a DA whose states are the equivalence classes of the right congruence, whose start state is the empty…
- Cslib.FLTS.toLTS_tr
FLTS.toLTScorrectly characterises transitions. - Cslib.FLTS.mtr_concat_eqCslib.FLTS.mtr_concat_eq
- Cslib.FLTS.mtrExtended transition function. Implementation note: compared to [Hopcroft2006], the definition consumes the input list of symbols from the…
- Cslib.FLTS.prodThe product of two FLTS with the same label type.
- Cslib.FLTS.toLTS
FLTSis a special case ofLTS. - Cslib.Automata.DA.MullerDeterministic Muller automaton.
- Cslib.Automata.DA.FinAccA deterministic automaton that accepts finite strings (lists of symbols).
- Cslib.FLTS.instCoeLTSCslib.FLTS.instCoeLTS
- Cslib.Automata.DAA deterministic automaton extends a
FLTSwith a unique initial state. - Cslib.FLTS.mtr_nil_eqCslib.FLTS.mtr_nil_eq
- Cslib.LTS.toFLTS_mem_trCharacterisation of transitions in
LTS.toFLTSwrt transitions in the originalLTS. - Cslib.LTS.chooseFLTSChoose an FLTS that is a "sub-LTS" of a total LTS.
- Cslib.LTS.toFLTSConverts an
LTSinto anFLTSusing the subset construction. - Cslib.Automata.DA.BuchiDeterministic Buchi automaton.
- Cslib.Automata.DA.prodThe product of two deterministic automata.
- Cslib.Automata.DA.FinAcc.instAcceptorA
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- A Functional Labelled Transition System (`FLTS`) for a type of states (`State`) and a type of transition labels (`Label`) consists of a labelled transition function (`tr`). -/ structure Cslib.FLTS (State Label : Type*) where /-- The transition function. -/ tr : State → Label → State