Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)

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 atomic 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]  Giorgio De Michelis,et al.  Concurrency versus interleaving: an instructuve example , 1987, Bull. EATCS.

[2]  Vaughan R. Pratt,et al.  Modeling concurrency with partial orders , 1986, International Journal of Parallel Programming.

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

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

[5]  Rocco De Nicola,et al.  Observational equivalences for concurrency models , 1987, Formal Description of Programming Concepts.

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

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

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

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

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

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

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

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

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

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

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

[17]  Wolfgang Reisig,et al.  Petri Nets: Applications and Relationships to Other Models of Concurrency , 1986, Lecture Notes in Computer Science.

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

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

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

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

[22]  Raymond R. Devillers,et al.  On the Definition of a Bisimulation Notion Based on Partial Words , 1988 .