Equivalences and Refinement

We investigate equivalence notions for concurrent systems. We consider “linear time” approaches where the system behaviour is characterised as the set of possible runs as well as “branching time” approaches where the conflict structure of systems is taken into account. We show that the usual interleaving equivalences, and also the equivalences based on steps (multisets of concurrently executed actions) are not preserved by refinement of actions. We prove that “linear time” partial order semantics, where causality in runs is explicit, is invariant under refinement. Finally, we consider various bisimulation equivalences based on partial orders and show that the strongest one of them is preserved by refinement whereas the others are not.

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

[2]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[3]  Glynn Winskel,et al.  Event Structures , 1986, Advances in Petri Nets.

[4]  Gérard Boudol,et al.  Algèbre de Processus et Synchronisation , 1984, Theor. Comput. Sci..

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

[6]  Wilfried Brauer,et al.  A survey of behaviour and equivalence preserving refinements of Petri nets , 1991, Applications and Theory of Petri Nets.

[7]  Walter Vogler.  Failures Semantics Based on Interval Semiwords is a Congruence for Refinement , 1990, STACS.

[8]  Roberto Gorrieri,et al.  A²CCS: A Simple Extension of CCS for Handling Atomic Actions , 1988, CAAP.

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

[10]  Walter Vogler,et al.  The Step Failure Semantics , 1987, STACS.

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

[12]  Philippe Darondeau,et al.  Event Structures, Causal Trees, and Refinements , 1990, MFCS.

[13]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

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

[15]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[16]  Jan A. Bergstra,et al.  Top-Down Design and the Algebra of Communicating Processes , 1985, Sci. Comput. Program..

[17]  Rocco De Nicola,et al.  Testing Equivalences for Event Structures , 1986, Mathematical Models for the Semantics of Parallelism.

[18]  Lucia Pomello,et al.  Some equivalence notions for concurrent systems. An overview , 1985, Applications and Theory in Petri Nets.

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

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

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

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

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

[24]  Ilaria Castellani,et al.  Permutation of transitions: An event structure semantics for CCS and SCCS , 1988, REX Workshop.

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

[26]  Giorgio De Michelis,et al.  Concurrency versus interleaving: an instructuve example , 1987, Bull. EATCS.

[27]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[28]  Kim S. Larsen,et al.  Fully abstract models for a process language with refinement , 1988, REX Workshop.