Split and ST bisimulation semantics 1

In this paper the notion of action atomicity is relaxed by permitting actions to be observed in the middle of their evolution. Non atomic semantic equivalences, based on the notion of bisimulation, are studied over stable event structures. Splitn bisimulation equivalence (denoted n ) considers each event as composed of n phases. ST bisimulation equivalence (denoted ST ) is a slight refinement of 2 where each ending phase is unambiguously associated to a beginning phase. We prove that, by increasing n, we get finer and finer equivalences (i.e. n+1 n ) and, moreover, that n+1 coincides with ST over those event structures whose autoconcurrency is at most n. The main consequence of these results is that, for image finite event structures, ST is the intersection of all the n . This paper will appear in Information and Computation. 1. The first author has been partially supported by the Italian CNR, grant n. 92.00069.CT12.115.25585, and the second author by Progetto Finalizzato “Calcolo Parallelo e Informatica” (obiettivo LAMBRUSCO) and Hewlett Packard Pisa Science Centre. 2. Dipartimento di Matematica, Università di Bologna, Piazza di Porta San Donato 5, I-40127 Bologna, Italy. E-mail: gorrieri@cs.unibo.it 3. Dipartimentodi Informatica –Università di Pisa,Corso Italia 40, I-56125,Pisa, Italy. E-mail: laneve@di.unipi.it

[1]  Robert de Simone,et al.  Higher-Level Synchronising Devices in Meije-SCCS , 1985, Theor. Comput. Sci..

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

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

[4]  Luca Aceto On "Axiomatising Finite Concurrent Processes" , 1994, SIAM J. Comput..

[5]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

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

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

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

[9]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

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

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