Arbeitspapiere der GMD Nr. 366. St. Augustin: Gesellschaft für Mathematik und Datenverarbeitung mbH, February 1989.
Also in: Kreczmar, A.; et al.: Lecture Notes in Computer Science, Vol. 379; Mathematical Foundations of Computer Science 1989, pages 237-248. Springer-Verlag, 1989. Extended abstract.
Abstract: The authors investigate equivalence notions for concurrent systems. They consider `linear time' approaches as well as `branching time' approaches where the conflict structure of systems is taken into account. They show that the usual interleaving equivalences, and also the equivalences based on steps are not preserved by refinement of atomic actions. They prove that `linear time' partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, they consider various bisimulation equivalences based on partial orders.
Keywords: equivalence (of) concurrent system; refinement (of action); interleaving equivalence; equivalence (based on steps); branching time; linear time; partial order semantics.