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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call