Event traces of labeled systems #
DynSystem.Labeled.Trace m s events t says that some finite orbit of the labeled system m
from s ends at t and emits exactly events. It is the labeled counterpart of
DynSystem.ReachableIn:
Trace.nilis the empty trace;Trace.appendconcatenates traces at a shared state, throughPrefix.append;Trace.reachableInforgets the events and keeps the trace's length.
def PFunctor.DynSystem.Labeled.Trace {p : PFunctor.{uA, uB}} (m : Labeled p) (s : m.State) (events : List m.Event) (t : m.State) :
Some finite orbit from s ends at t with exactly the event trace events.
Equations
Instances For
theorem PFunctor.DynSystem.Labeled.Trace.nil {p : PFunctor.{uA, uB}} {m : Labeled p} (s : m.State) :
The empty trace stays put.
theorem PFunctor.DynSystem.Labeled.Trace.reachableIn {p : PFunctor.{uA, uB}} {m : Labeled p} {s t : m.State} {events : List m.Event} (trace : m.Trace s events t) :
m.toDynSystem.ReachableIn events.length s t
A trace witnesses reachability in as many steps as it has events.