(** ** Transitions preserve semantics *)

(** We define the semantics of states as follows.
  For a triple [mu, sigma, tau], we perform the moves [tau] in
  reverse sequential order, then the moves [mu ++ sigma] in parallel. *)

Definition statemove (st: state) (e: env) :=
  match st with
  | State mu sigma tau => exec_par (mu ++ sigma) (exec_seq_rev tau e)
  end.

Lemma exec_par_append_eq: forall m1 m2 m3 e2 e3, exec_par m2 e2 = exec_par m3 e3 -> (forall r, In r (srcs m1) -> e2 r = e3 r) -> exec_par (m1 ++ m2) e2 = exec_par (m1 ++ m3) e3.