Reactive Systems, Barbed Semantics, and the Mobile Ambients
Reactive systems, proposed by Leifer and Milner, represent a meta-framework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics is provided by rewriting rules. Despite its applicability, reactive systems suffered so far from two main drawbacks. First of all, no technique was found for recovering a set of inference rules, e.g. in the so-called SOS style, for describing the distilled observational semantics. Most importantly, the efforts focused on strong bisimilarity, tackling neither weak nor barbed semantics.
Our paper addresses both issues, instantiating them on a calculus whose semantics is still in a flux: Cardelli and Gordon’s mobile ambients.
While the solution to the first issue is tailored over our case study, we provide a general framework for recasting (weak) barbed equivalence in the reactive systems formalism. Moreover, we prove that our proposal captures the behavioural semantics for mobile ambients proposed by Rathke and Sobociński and by Merro and Zappa Nardelli.
KeywordsReactive System Inference Rule Label Transition System Reduction Rule Weak Reduction
- 2.Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: Logic in Computer Science, pp. 69–80. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- 3.Bonchi, F.: Abstract Semantics by Observable Contexts. PhD thesis, Department of Informatics, University of Pisa (2008)Google Scholar
- 5.Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Petri Nets and Graph Transformation. ENTCS, vol. 127, pp. 107–120. Elsevier, Amsterdam (2005)Google Scholar
- 10.Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled transitions for mobile ambients (as synthesized via a graphical encoding). In: Expressiveness in Concurrency. ENTCS. Elsevier, Amsterdam (forthcoming, 2008)Google Scholar
- 14.Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Logic in Computer Science, pp. 311–320. IEEE Computer Society, Los Alamitos (2005)Google Scholar
- 18.Milner, R.: Local bigraphs and confluence: Two conjectures. In: Expressiveness in Concurrency. ENTCS, vol. 175, pp. 65–73. Elsevier, Amsterdam (2007)Google Scholar
- 20.Jensen, O., Milner, R.: Bigraphs and transitions. In: Principles of Programming Languages, pp. 38–49. ACM Press, New York (2003)Google Scholar