Abstract. We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients, by focusing on a standard contextual equivalence, reduction barbed congruence. We prove a context lemma that allows the derivation of contextual equivalences by considering only contexts for concurrency and locality. We go further and give a characterisation of reduction barbed congruence over arbitrary processes in terms of a labelled bisimilarity defined over a restricted class of processes, called systems. This characterisation extends and completes an earlier result on bisimulation proof methods for Mobile Ambients, that was restricted to systems. The characterisation is then used to prove a collection of algebraic laws. 1
|
2762
|
Communication and Concurrency
– Milner
- 1989
|
|
886
|
A Calculus of Mobile Processes
– Milner, Parrow, et al.
- 1992
|
|
663
|
Mobile ambients
– Cardelli, Gordon
|
|
541
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
339
|
Testing equivalences for processes
– Nicola, Hennessy
- 1984
|
|
283
|
An Object Calculus for Asynchronous Communication
– Honda, Tokoro
- 1991
|
|
232
|
Expressing Mobility in Process Algebras: First-Order and HigherOrder Paradigms
– Sangiorgi
- 1992
|
|
226
|
The π–calculus: A Theory of Mobile Processes
– Sangiorgi, Walker
- 2001
|
|
181
|
Barbed bisimulation
– Milner, Sangiorgi
- 1992
|
|
124
|
Controlling Interference in Ambients
– Levi, Sangiorgi
- 2000
|
|
113
|
On reduction-based process semantics
– Honda, Yoshida
- 1995
|
|
89
|
Proving congruence of bisimulation in functional programming languages
– Howe
- 1996
|
|
86
|
Seal: A framework for secure mobile computations
– Vitek, Castagna
|
|
85
|
A typed language for distributed mobile processes
– Riely, Hennessy
- 1998
|
|
79
|
Deriving bisimulation congruences for reactive systems
– Leifer, Milner
- 2000
|
|
63
|
An efficiency preorder for processes
– Arun-Kumar, Hennessy
- 1992
|
|
55
|
From rewrite rules to bisimulation congruences
– Sewell
|
|
54
|
Equational Properties of Mobile Ambients
– Gordon, Cardelli
- 2003
|
|
51
|
On the bisimulation proof method
– Sangiorgi
- 1994
|
|
50
|
Bisimulation Congruences in Safe Ambients
– Merro, Hennessy
- 2002
|
|
46
|
A hierarchy of equivalences for asynchronous calculi
– Fournet, Gonthier
- 1998
|
|
45
|
Bigraphs and mobile processes (revised
– Jensen, Milner
- 2004
|
|
43
|
The problem of “weak bisimulation up to
– Sangiorgi, Milner
- 1992
|
|
43
|
Communication interference in mobile boxed ambients
– Bugliesi, Crafa, et al.
- 2002
|
|
41
|
Bisimulation for Higher-Order Process Calculi
– Sangiorgi
- 1996
|
|
40
|
A calculus of mobile resources
– Godskesen, Hildebrandt, et al.
- 2002
|
|
40
|
On Bisimulations for Asynchronous πCalculus
– Amadio, Castellani, et al.
- 1996
|
|
38
|
Nomadic Pict: Correct communication infrastructure for mobile computation
– Unyapoth, Sewell
- 2001
|
|
36
|
Extensionality and intensionality of the ambient logic
– Sangiorgi
- 2001
|
|
33
|
Towards a behavioural theory of access and mobility control in distributed systems
– Hennessy, Merro, et al.
- 2002
|
|
29
|
Locality and non-interleaving semantics in calculi for mobile processes
– Sangiorgi
- 1996
|
|
27
|
SafeDpi: a language for controlling mobile code
– Hennessy, Rathke, et al.
- 2004
|
|
24
|
Wide Area Computation
– Cardelli
- 1999
|
|
22
|
A LTS semantics of ambients via graph synchronization with mobility
– Ferrari, Montanari, et al.
- 2001
|
|
22
|
The Seal calculus revisited: Contextual equivalences and bisimilarity
– Castagna, Nardelli
|
|
16
|
Mobile safe ambients
– Levi, Sangiorgi
- 2003
|
|
15
|
Bisimulation proof methods for mobile ambients
– Merro, Nardelli
- 2003
|
|
12
|
The kell calculus: A family of higher-order distributed process calculi
– Schmitt, Stefani
- 2005
|
|
9
|
Separability, Expressiveness and Decidability in the Ambient Logic
– Hirschkoff, Lozes, et al.
- 2002
|
|
8
|
The Seal calculus
– Castagna, Vitek, et al.
- 2005
|
|
7
|
A bisimulation-based semantic theory of safe ambients
– Merro, Hennessy
- 2006
|
|
7
|
Transition systems for the ambient calculus
– Vigliotti
- 1999
|
|
5
|
A commitment relation for the ambient calculus. Unpublished notes
– Cardelli, Gordon
- 1996
|
|
4
|
Some results on barbed equivalences in pi-calculus
– Sangiorgi, Walker
- 2001
|
|
2
|
Contextual equivalence for higher-order π-calculus revisited
– Jeffrey, Rathke
- 2003
|
|
2
|
Controlling interference in ambients. An extended abstract appeared
– Levi, Sangiorgi
- 2000
|
|
1
|
The ns-2 simulator”, http://www-mash.cs.berkeley.edu/ns
– unknown authors
- 1998
|
|
1
|
Asynchrony and the π-calculus. Tech. Rep. RR-1702, INRIA-Sophia Antipolis
– Boudol
- 1992
|
|
1
|
Communication and mobility control in boxed ambients. Information and Computation. In press. An extended abstract appeared
– Bugliesi, Crafa, et al.
- 2005
|
|
1
|
Bisimulation congruences for homer
– Hildebrandt, Godskesen, et al.
- 2004
|
