In: Theoretical Computer Science, Vol. 114, pages 173-200. 1993.
Abstract: For event structures with silent moves, we consider several types of bisimulation that incorporate ``true'' concurrency to a varying degree, and show how each can be lifted in a uniform way to a congruence with respect to action refinement. We prove that we have constructed the coarsest congruences that respect interleaving, pomset and history-preserving bisimulation