Bisimulation and Action Refinement

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.

[1]  Rob J. van Glabbeek,et al.  Petri Net Models for Algebraic Theories of Concurrency , 1987, PARLE.

[2]  Raymond R. Devillers.  Maximality Preserving Bisimulation , 1992, Theor. Comput. Sci..

[3]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[4]  Rocco De Nicola,et al.  Partial orderings descriptions and observations of nondeterministic concurrent processes , 1988, REX Workshop.

[5]  Ilaria Castellani,et al.  On the Semantics of Concurrency: Partial Orders and Transition Systems , 1987, TAPSOFT, Vol.1.

[6]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[7]  Philippe Darondeau,et al.  Causal Trees , 1989, ICALP.

[8]  Cosimo Laneve,et al.  The Limit of Split_n-Bisimulations for CCS Agents , 1991, International Symposium on Mathematical Foundations of Computer Science.

[9]  Ursula Goltz,et al.  Refinement of Actions in Causality Based Models , 1990, REX Workshop.

[10]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[11]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

[12]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[13]  Luca Aceto,et al.  Towards action-refinement in process algebras , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[14]  Rob J. van Glabbeek.  The Refinement Theorem for ST-bisimulation Semantics , 1990, Programming Concepts and Methods.

[15]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[16]  Eike Best,et al.  Nonsequential Processes: A Petri Net View , 1988 .

[17]  Walter Vogler,et al.  Bisimulation and Action Refinement , 1991, Theor. Comput. Sci..

[18]  Luca Aceto,et al.  Adding Action Refinement to a Finite Process Algebra , 1991, Inf. Comput..

[19]  Raymond R. Devillers.  Maximality preservation and the ST-idea for action refinements , 1992, Advances in Petri Nets: The DEMON Project.