Section Executions.
Context
{Sem : Semantics}
{initU : seq.seq nat}
{SemAx : CoreLanguage.SemAxioms}
{SemD : CoreLanguage.SemDet}
{DilMem : DiluteMem}
{Res: Resources}.
(* Existing Instance FineDilMem. *)
Existing Instance HybridFineMachine.scheduler.
Existing Instance OrdinalPool.OrdinalThreadPool.
Context {Hbs : MachineSig}.
(** Reflexive-transitive closure of machine step relation*)
Inductive multi_step :
MachState -> mem -> MachState -> mem -> Prop :=
| Step_refl : forall ms (m : mem),
multi_step ms m ms m
| Step_trans : forall i U U'
(tp tp' tp'' : t)
tr tr' tr''
(m m' m'' : mem),
MachStep (i :: U, tr, tp) m (U, tr ++ tr', tp') m' ->
multi_step (U, tr ++ tr', tp') m' (U', tr ++ tr' ++ tr'', tp'') m'' ->
multi_step (i :: U,tr,tp) m (U',tr ++ tr' ++ tr'',tp'') m''.
(** Complete executions (until the schedule is empty) of the FineConc machine*)
Inductive fine_execution :
MachState -> mem -> MachState -> mem -> Prop :=
| fine_completed : forall ms (m : mem),
halted_machine ms ->
fine_execution ms m ms m
| fine_exec : forall i U U'
tp tp' tp''
tr tr' tr''
(m m' m'' : mem),
MachStep (i :: U, tr, tp) m (U, tr ++ tr', tp') m' ->
fine_execution (U, tr ++ tr', tp') m' (U', tr ++ tr' ++ tr'', tp'') m'' ->
fine_execution (i :: U,tr,tp) m (U',tr ++ tr' ++ tr'',tp'') m''.
(** ** Generic Properties of executions and steps *)

(** Decomposing steps on any kind of event. This theorem is stronger than the previous one *)
Lemma multi_step_inv:
forall U U' i tr tr' tp m tp' m' ev
(Hi: nth_error tr' i = Some ev)
(Hexec: multi_step (U, tr, tp) m (U', tr ++ tr', tp') m'),
exists U'' U''' tp'' m'' tr'' pre_ev post_ev  tp''' m''',
multi_step (U, tr, tp) m (U'', tr ++ tr'', tp'') m'' /\
MachStep (U'', tr ++ tr'', tp'') m''
(U''', tr ++ tr'' ++ pre_ev ++ [:: ev] ++ post_ev, tp''') m''' /\
multi_step (U''', tr ++ tr'' ++ pre_ev ++ [:: ev] ++ post_ev , tp''') m'''
(U', tr ++ tr', tp') m' /\
length (tr'' ++ pre_ev) = i.