On Barbs and Labels in Reactive Systems

Reactive systems (RSs) represent a meta-framework aimed at deriving behavioral congruences for those computational formalisms whose operational semantics is provided by reduction rules. RSs proved a flexible specification device, yet so far most of the efforts dealing with their behavioural semantics focused on idem pushouts (IPOs) and saturated (also known as dynamic) bisimulations. In this paper we introduce a novel, intermediate behavioural equivalence: L-bisimilarity, which is able to recast both its IPO and saturated counterparts. The equivalence is parametric with respect to a set L of RSs labels, and it is shown that under mild conditions on L it is indeed a congruence. Furthermore, L-bisimilarity can also recast the notion of barbed semantics for RSs, proposed by the same authors in a previous paper. In order to provide a suitable test-bed, we instantiate our proposal by addressing the semantics of (asynchronous) CCS and of the calculus of mobile ambients.

[1]  Hartmut Ehrig,et al.  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts , 2006, Mathematical Structures in Computer Science.

[2]  Robin Milner,et al.  Bigraphs for Petri Nets , 2003, Lectures on Concurrency and Petri Nets.

[3]  Robin Milner,et al.  Deriving Bisimulation Congruences for Reactive Systems , 2000, CONCUR.

[4]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[5]  Matthew Hennessy,et al.  Testing Theories for Asynchronous Languages , 1998, FSTTCS.

[6]  Julian Rathke,et al.  Making the Unobservable, Unobservable , 2009, Electron. Notes Theor. Comput. Sci..

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

[8]  Fabio Gadducci,et al.  Synthesising CCS bisimulation using graph rewriting , 2009, Inf. Comput..

[9]  Filippo Bonchi,et al.  Abstract Semantics by Observable Contexts , 2008, ICGT.

[10]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[11]  Fabio Gadducci,et al.  Reactive Systems, Barbed Semantics, and the Mobile Ambients , 2009, FoSSaCS.

[12]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[13]  Vladimiro Sassone,et al.  Reactive systems over cospans , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[14]  Fabio Gadducci,et al.  Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding) , 2008, EXPRESS.

[15]  Vladimiro Sassone,et al.  A Congruence for Petri Nets , 2005, PNGT@ICGT.

[16]  Julian Rathke,et al.  Semantic Barbs and Biorthogonality , 2007, FoSSaCS.

[17]  Robin Milner,et al.  Barbed Bisimulation , 1992, ICALP.

[18]  Ugo Montanari,et al.  Saturated Semantics for Reactive Systems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[19]  Davide Sangiorgi,et al.  Communicating and Mobile Systems: the π-calculus, , 2000 .

[20]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[21]  Davide Sangiorgi,et al.  On Bisimulations for the Asynchronous pi-Calculus , 1996, Theor. Comput. Sci..

[22]  Vladimiro Sassone.  Foundations of Software Science and Computational Structures, 8th International Conference, FOSSACS 2005, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2005, Edinburgh, UK, April 4-8, 2005, Proceedings , 2005, FoSSaCS.

[23]  Rocco De Nicola,et al.  Asynchronous Observations of Processes , 1998, FoSSaCS.