In: Choffrut, C.; et al.: Lecture Notes in Computer Science, Vol. 480; STACS 91. Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science, 1991, Hamburg, Germany, pages 309-321. Berlin, Germany: Springer-Verlag, 1991.
Also in: 91; 3rd Workshop on Concurrency and Compositionality, 1991, Goslar, Germany / Best, E.; et al.: GMD-Studien Nr. 191; Hildesheimer Informatik-Berichte 6, pages 216-221. St. Augustin, Germany: Gesellschaft für Mathematik und Datenverarbeitung mbH --- Universität Hildesheim (Germany), Institut für Informatik, May 1991. Extended abstract.
Abstract: For event structures with silent moves the author considers several types of bisimulation that incorporate `true' concurrency to a varying degree, and shows how each can be liftet in a uniform way to a congruence w.r.t. action refinement. The author proves that the coarsest congruences were constructed that respect interleaving, pomset and history preserving bisimulation.
Keywords: action refinement (by) conflict-free subsystem(s); labelled prime event structure (with) binary conflict(s) (and) silent move(s); (ST-) bisimilarity; history preserving bisimulation (for) safe net(s); (OM-) bisimulation; ordered marking; interleaving.