×

zbMATH — the first resource for mathematics

Bisimulation and action refinement. (English) Zbl 0773.68052
Theoretical aspects of computer science, Proc. 8th Annu. Symp., STACS ’91, Hamburg/Ger. 1991, Lect. Notes Comput. Sci. 480, 309-321 (1991).
Summary: [For the entire collection see Zbl 0753.00019.]
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 w.r.t. action refinement. We prove that we have constructed the coarsest congruences that respect interleaving, pomset and history preserving bisimulation.

MSC:
68Q55 Semantics in the theory of computing
68Q10 Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
PDF BibTeX XML Cite