R. Amadio, I. Castellani, and D. Sangiorgi, On bisimulations for the asynchronous ??-calculus, Theoretical Computer Science, vol.195, issue.2, pp.291-324, 1998.
DOI : 10.1016/S0304-3975(97)00223-5
URL : https://hal.archives-ouvertes.fr/inria-00073784

S. Arun-kumar and M. Hennessy, An efficiency preorder for processes, Acta Informatica, vol.25, issue.1, pp.737-760, 1992.
DOI : 10.1007/BF01191894

G. Boudol, Asynchrony and the ?-calculus, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00076939

M. Bugliesi, S. Crafa, M. Merro, and V. Sassone, Communication interference in mobile boxed ambients. Forthcoming Technical Report. An extended abstract, Proc. FSTTCS'02

L. Cardelli and A. Gordon, A commitment relation for the ambient calculus. Unpublished notes, 1996.

L. Cardelli and A. Gordon, Mobile ambients, Proc. of FoSSaCS '98, pp.177-213, 2000.
DOI : 10.1016/S0304-3975(99)00231-5

G. Castagna and F. Z. Nardelli, The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity, Proc. 22nd FSTTCS '02, 2002.
DOI : 10.1007/3-540-36206-1_9

R. , D. Nicola, and M. Hennessy, Testing equivalences for processes, Theoretical Computer Science, vol.34, pp.83-133, 1984.

G. Ferrari, U. Montanari, and E. Tuosto, A LTS Semantics of Ambients via Graph Synchronization with Mobility, Proc. ICTCS, 2001.
DOI : 10.1007/3-540-45446-2_1

C. Fournet and G. Gonthier, A hierarchy of equivalences for asynchronous calculi, Proc. 25th ICALP, pp.844-855, 1998.

J. C. Godskesen, T. Hildebrandt, and V. Sassone, A Calculus of Mobile Resources*, Proc. 10th CONCUR '02, 2002.
DOI : 10.1007/3-540-45694-5_19

A. D. Gordon and L. Cardelli, Equational properties of mobile ambients, Proc. FoSSaCs '99, pp.1-38, 2002.

M. Hennessy, M. Merro, and J. Rathke, Towards a behavioural theory of access and mobility control in distributed system, Proc. 5th FoSSaCS '03, 2003.

M. Hennessy, J. Rathke, and N. Yoshida, Safedpi: A language for controlling mobile code, An extended abstract appeared in the Proc. FOSSACS'04, p.2, 2003.

M. Hennessy and J. Riely, A typed language for distributed mobile processes, Proc. 25th POPL, 1998.

K. Honda and M. Tokoro, An object calculus for asynchronous communication, Proc. ECOOP '91, 1991.
DOI : 10.1007/BFb0057019

K. Honda and N. Yoshida, Replication in concurrent combinators, Proc. TACS'94, 1994.
DOI : 10.1007/3-540-57887-0_125

K. Honda and N. Yoshida, On reduction-based process semantics, Theoretical Computer Science, vol.152, issue.2, pp.437-486, 1995.
DOI : 10.1007/3-540-57529-4_70
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.9756

O. H. Jensen and R. Milner, Bigraphs and mobile processes (revised), An extended abstract appeared in Conference Record of 30th Symposium on Principles of Programming Languages, 2003.

J. J. Leifer and R. Milner, Deriving Bisimulation Congruences for Reactive Systems, CON- CUR 2000 -Concurrency Theory, 11th International Conference Proceedings, volume 1877 of LNCS, pp.243-258, 2000.
DOI : 10.1007/3-540-44618-4_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.9271

F. Levi and D. Sangiorgi, Controlling interference in ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, 2000.
DOI : 10.1145/325694.325741

F. Levi and D. Sangiorgi, Controlling interference in ambients. An extended abstract, Proc. 27th Symposium on Principles of Programming Languages, 2000.

M. Merro and M. Hennessy, Bisimulation congruences in safe ambients, Proc. 29th POPL '02, 2002.

M. Merro and M. Hennessy, A bisimulation-based semantic theory of Safe Ambients, ACM Transactions on Programming Languages and Systems, vol.28, issue.2, 2004.
DOI : 10.1145/1119479.1119482

R. Milner, Communication and Concurrency, 1989.

R. Milner, The polyadic ??-calculus, LFCS, Dept. of Comp. Sci., Edinburgh Univ, 1991.
DOI : 10.1007/BFb0084778

R. Milner, J. Parrow, and D. Walker, A calculus of mobile processes, (Parts I and II) Information and Computation, pp.1-77, 1992.

R. Milner and D. Sangiorgi, Barbed bisimulation, Proc. 19th ICALP, pp.685-695, 1992.
DOI : 10.1007/3-540-55719-9_114

D. M. Park, Concurrency and automata on infinite sequences, Conf. on Theoretical Computer Science, 1981.
DOI : 10.1007/BFb0017309

D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, 1992.

D. Sangiorgi, Bisimulation for Higher-Order Process Calculi, Information and Computation, vol.131, issue.2, pp.141-178, 1996.
DOI : 10.1006/inco.1996.0096
URL : https://hal.archives-ouvertes.fr/inria-00074170

D. Sangiorgi, Locality and interleaving semantics in calculi for mobile processes, Theoretical Computer Science, vol.155, issue.1, pp.39-83, 1996.
DOI : 10.1016/0304-3975(95)00020-8

D. Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science, vol.8, issue.5, pp.447-479, 1998.
DOI : 10.1017/S0960129598002527

D. Sangiorgi, Extensionality and intensionality of the ambient logic, Proc. 28th POPL, 2001.

D. Sangiorgi and R. Milner, The problem of ???weak bisimulation up to???, Proc. CONCUR '92, pp.32-46, 1992.
DOI : 10.1007/BFb0084781

D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, 2001.

D. Sangiorgi and D. Walker, Some results on barbed equivalences in pi-calculus, Proc. CONCUR '01, 2001.

A. Schmitt and J. Stefani, The Kell Calculus: A Family of Higher-Order Distributed Process Calculi, LNCS, 2004.
DOI : 10.1007/3-540-45694-5_19

P. Sewell, From rewrite rules to bisimulation congruences, Theoretical Computer Science, vol.274, issue.1-2, 2003.
DOI : 10.1016/S0304-3975(00)00309-1

M. Bundgaard, T. Hildebrandt, and J. C. Godskesen, Bisimulation congruences for homer, 2004.

A. Unyapoth and P. Sewell, Nomadic Pict: Correct communication infrastructures for mobile computation, Proc. 28th POPL, 2001.

M. G. Vigliotti, Transition systems for the ambient calculus, 1999.

J. Vitek and G. Castagna, Seal: A Framework for Secure Mobile Computations, Internet Programming Languages, number 1686 in LNCS, pp.47-77, 1999.
DOI : 10.1007/3-540-47959-7_3