Cslib.LTS.Execution
defimported Lean
Execution extends MTr by providing the intermediate states of a multistep transition.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib in variable {State Label : Type*} {lts : LTS State Label} in @[grind =] def Cslib.LTS.Execution (lts : LTS State Label) (s1 : State) (μs : List Label) (s2 : State) (ss : List State) : Prop
- Defined in
- CSLib, `Cslib.LTS.Execution`
- Lean proof
- By Fabrizio Montesi, Ching-Tsun Chou, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2026 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.Execution← Cslib.LTS.Execution (Cslib/Foundations/Semantics/LTS/Execution.lean:23): adapted
What was changed in
Cslib.LTS.Execution--- Cslib/Foundations/Semantics/LTS/Execution.lean:23 (Cslib.LTS.Execution) +++ as compiled here @@ -1,4 +1,7 @@ -/-- `Execution` extends `MTr` by providing the intermediate states of a multistep transition. -/ -@[scoped grind =] -def Execution (lts : LTS State Label) (s1 : State) (μs : List Label) (s2 : State) +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib in +variable {State Label : Type*} {lts : LTS State Label} in +@[grind =] +def Cslib.LTS.Execution (lts : LTS State Label) (s1 : State) (μs : List Label) (s2 : State) (ss : List State) : Prop := - 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…
- Cslib.LTSA Labelled Transition System (LTS) for a type of states (
- Used by 9
- Cslib.LTS.Execution.cons_invertDeconstruction of executions with
List.cons. - Cslib.LTS.Execution.to_mTrConverts an execution into a multistep transition.
- Cslib.LTS.Acyclic.toBoundedUpToOn a finite state space, an acyclic LTS has execution length strictly less than the number of states.
- Cslib.LTS.Execution.isChainThe states visited by an execution form a chain in the underlying unlabelled relation.
- Cslib.LTS.Execution.nonEmpty_statesEvery execution has at least one intermediate state.
- Cslib.LTS.Execution.stepLEquivalent of
MTr.stepLfor executions. - Cslib.LTS.Execution.of_mTrA multistep transition implies the existence of an execution.
- Cslib.LTS.Execution.splitAn execution can be split at any intermediate state into two executions.
- Cslib.LTS.Execution.reflEvery state has an execution of zero steps terminating in itself.
- Cslib.LTS.Execution.cons_invertDeconstruction of executions with
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 /-- `Execution` extends `MTr` by providing the intermediate states of a multistep transition. -/ @[grind =] def Cslib.LTS.Execution (lts : LTS State Label) (s1 : State) (μs : List Label) (s2 : State) (ss : List State) : Prop := ∃ _ : ss.length = μs.length + 1, ss[0] = s1 ∧ ss[ss.length - 1] = s2 ∧ ∀ k, {_ : k < μs.length} → lts.Tr ss[k] μs[k] ss[k + 1]