Finite prefixes and infinite runs of dynamic concurrent processes #
This file extends finite executions in the two directions needed for semantic reasoning about ongoing concurrent behavior.
ProcessOver.Prefixis the right notion of a finite initial segment of an execution. UnlikeProcessOver.Trace, it may stop at any residual process state, not only at a quiescent one.ProcessOver.Runis an infinite execution, represented by the residual process state at each time index together with the complete path chosen for the corresponding process step.
The closed-world Process API is recovered as a specialization of these
generic definitions.
Prefix process p n is a finite prefix of length n of an execution starting
from the residual process state p: the dynamical-system Prefix at the step
polynomial, where each step records one complete sequential path of the
current process step.
Unlike ProcessOver.Trace, a Prefix may stop at any residual state. This
makes it the correct finite prefix object for later infinite-run semantics.
Equations
- process.Prefix = PFunctor.DynSystem.Prefix process
Instances For
The sequence of current controlling parties exposed by a finite prefix after
projecting the generic context into StepContext.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.ProcessOver.Prefix.currentControllers resolve PFunctor.DynSystem.Prefix.nil = []
Instances For
The sequence of full controller paths exposed by a finite prefix after
projecting the generic context into StepContext.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.ProcessOver.Prefix.controllerPaths resolve PFunctor.DynSystem.Prefix.nil = []
Instances For
The stable event labels attached to the executed steps of a finite prefix.
Equations
Instances For
The stable tickets attached to the executed steps of a finite prefix.
Equations
- Interaction.Concurrent.ProcessOver.Prefix.tickets ticketMap = PFunctor.DynSystem.Prefix.tickets ticketMap
Instances For
Forget the quiescence proof of a finite Trace and keep only its executed
prefix.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.ProcessOver.Prefix.ofTrace (Interaction.Concurrent.ProcessOver.Trace.done a) = PFunctor.DynSystem.Prefix.nil
Instances For
Run process is an infinite execution of the dynamic process process: the
dynamical-system Run at the step polynomial.
It is represented by:
state n, the residual process state afterncomplete process steps;path n(the genericdirfield), the concrete path chosen for stepn;next_state, which states that the residual state stream follows the process continuation exactly.
This is a continuation-based infinite semantics: the run does not introduce a new operational state space of its own. It simply records how the residual process state evolves when one complete process step is chosen at each time.
Equations
- process.Run = PFunctor.DynSystem.Run process
Instances For
The concrete path chosen for step n: the run's generic direction
choice, read at the step-polynomial interface.
Instances For
The initial residual process state of a run.
Equations
- run.initial = PFunctor.DynSystem.Run.initial run
Instances For
The first complete process-step path of the run.
Equations
- run.head = PFunctor.DynSystem.Run.head run
Instances For
The tail of a run after its first process step.
Equations
- run.tail = PFunctor.DynSystem.Run.tail run
Instances For
The initial state of run.tail is exactly the residual state obtained by
executing run.head.
take run n is the length-n finite execution prefix of the infinite run
run.
Equations
- run.take = PFunctor.DynSystem.Run.take run
Instances For
The current controlling party of step n of a run, if any, after projecting
the generic context into StepContext.
Equations
- Interaction.Concurrent.ProcessOver.Run.currentController? resolve run n = (Interaction.Concurrent.StepOver.mapContext resolve (process.step (run.state n))).currentController? (run.path n)
Instances For
The current controlling parties exposed along the first n executed steps
of the run run.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.ProcessOver.Run.currentControllersUpTo resolve run 0 = []
Instances For
The full controller path recorded by step n of a run after projecting the
generic context into StepContext.
Equations
- Interaction.Concurrent.ProcessOver.Run.controllerPath resolve run n = (Interaction.Concurrent.StepOver.mapContext resolve (process.step (run.state n))).controllerPath (run.path n)
Instances For
The full controller paths exposed along the first n executed steps of the
run run.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.ProcessOver.Run.controllerPathsUpTo resolve run 0 = []
Instances For
The stable event label attached to step n of a run.
Equations
- Interaction.Concurrent.ProcessOver.Run.event eventMap run n = PFunctor.DynSystem.Run.event eventMap run n
Instances For
The stable event labels attached to the first n executed steps of the run
run.
Equations
- Interaction.Concurrent.ProcessOver.Run.eventsUpTo eventMap run = PFunctor.DynSystem.Run.eventsUpTo eventMap run
Instances For
The stable ticket attached to step n of a run.
Equations
- Interaction.Concurrent.ProcessOver.Run.ticket ticketMap run n = PFunctor.DynSystem.Run.ticket ticketMap run n
Instances For
The stable tickets attached to the first n executed steps of the run
run.
Equations
- Interaction.Concurrent.ProcessOver.Run.ticketsUpTo ticketMap run = PFunctor.DynSystem.Run.ticketsUpTo ticketMap run
Instances For
RelUpTo rel left right n states that the first n executed steps of the
runs left and right match step-by-step according to rel.
Equations
- Interaction.Concurrent.ProcessOver.Run.RelUpTo rel leftRun rightRun = PFunctor.DynSystem.Run.RelUpTo rel leftRun rightRun
Instances For
Rel rel left right states that every finite prefix of the runs left and
right matches according to rel.
Equations
- Interaction.Concurrent.ProcessOver.Run.Rel rel leftRun rightRun = PFunctor.DynSystem.Run.Rel rel leftRun rightRun
Instances For
Pointwise step matching implies prefix matching of the first n steps.
Pointwise step matching implies full run matching.
The closed-world specialization of ProcessOver.Prefix.
Equations
- process.Prefix = Interaction.Concurrent.ProcessOver.Prefix process
Instances For
The sequence of current controlling parties exposed by a finite closed-world prefix.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.Process.Prefix.currentControllers PFunctor.DynSystem.Prefix.nil = []
Instances For
The sequence of full controller paths exposed by a finite closed-world prefix.
Equations
- One or more equations did not get rendered due to their size.
- Interaction.Concurrent.Process.Prefix.controllerPaths PFunctor.DynSystem.Prefix.nil = []
Instances For
The stable event labels attached to the executed steps of a finite closed-world prefix.
Equations
Instances For
The stable tickets attached to the executed steps of a finite closed-world prefix.
Equations
Instances For
Forget the quiescence proof of a finite closed-world trace and keep only its executed prefix.
Equations
Instances For
The closed-world specialization of ProcessOver.Run.
Equations
- process.Run = Interaction.Concurrent.ProcessOver.Run process
Instances For
The initial residual process state of a closed-world run.
Equations
Instances For
The first complete process-step path of a closed-world run.
Equations
Instances For
The current controlling party of step n of a closed-world run, if any.
Equations
- run.currentController? n = (Interaction.Concurrent.ProcessOver.step process (run.state n)).currentController? (Interaction.Concurrent.ProcessOver.Run.path run n)
Instances For
The current controlling parties exposed along the first n executed steps
of a closed-world run.
Equations
- run.currentControllersUpTo 0 = []
- run.currentControllersUpTo n.succ = run.currentController? 0 :: run.tail.currentControllersUpTo n
Instances For
The full controller path recorded by step n of a closed-world run.
Equations
- run.controllerPath n = (Interaction.Concurrent.ProcessOver.step process (run.state n)).controllerPath (Interaction.Concurrent.ProcessOver.Run.path run n)
Instances For
The full controller paths exposed along the first n executed steps of a
closed-world run.
Equations
- run.controllerPathsUpTo 0 = []
- run.controllerPathsUpTo n.succ = run.controllerPath 0 :: run.tail.controllerPathsUpTo n
Instances For
The stable event label attached to step n of a closed-world run.
Equations
- Interaction.Concurrent.Process.Run.event eventMap run n = Interaction.Concurrent.ProcessOver.Run.event eventMap run n
Instances For
The stable event labels attached to the first n executed steps of a
closed-world run.
Equations
- Interaction.Concurrent.Process.Run.eventsUpTo eventMap run = Interaction.Concurrent.ProcessOver.Run.eventsUpTo eventMap run
Instances For
The stable ticket attached to step n of a closed-world run.
Equations
- Interaction.Concurrent.Process.Run.ticket ticketMap run n = Interaction.Concurrent.ProcessOver.Run.ticket ticketMap run n
Instances For
The stable tickets attached to the first n executed steps of a
closed-world run.
Equations
- Interaction.Concurrent.Process.Run.ticketsUpTo ticketMap run = Interaction.Concurrent.ProcessOver.Run.ticketsUpTo ticketMap run