M. Arun-kumar and . Hennessy, An Efficiency Preorder for Processes, Acta Informatica, vol.29, issue.9, 1992.

P. Bidinger and J. Stefani, The Kell Calculus: Operational Semantics and Type System, Proc. of FMOODS '03, 2003.
DOI : 10.1007/3-540-47959-7_3

M. Bugliesi, G. Castagna, and S. Crafa, Boxed Ambients, Proc. TACS '01, 2001.
DOI : 10.1007/3-540-45500-0_2

URL : https://hal.archives-ouvertes.fr/hal-00152525

L. Cardelli and A. Gordon, Mobile Ambients, Proc. FOSSACS '98, 1998.
DOI : 10.1016/s1571-0661(05)80699-1

URL : http://doi.org/10.1016/s1571-0661(05)80699-1

G. Castagna and F. Z. Nardelli, The Seal Calculus Revisited, Proc. of FSTTCS '02, 2002.

A. Ciaffaglione, M. Hennessy, and J. Rathke, Proof Methodologies for Behavioural Equivalence in Dpi, Proc. FORTE '05, 2005.
DOI : 10.1007/978-3-540-24727-2_18

C. Fournet, The Join-Calculus: a Calculus for Distributed Mobile Programming, 1998.

C. Fournet, F. L. Fessant, L. Maranget, and A. Schmitt, JoCaml: A Language for Concurrent Distributed and Mobile Programming, Proc. of Advanced Functional Programming, 2002.
DOI : 10.1007/978-3-540-44833-4_5

C. Fournet and G. Gonthier, The reflexive CHAM and the join-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '96, 1996.
DOI : 10.1145/237721.237805

C. Fournet and G. Gonthier, The Join Calculus: A Language for Distributed Mobile Programming, Proc. APPSEM, 2000.
DOI : 10.1007/3-540-45699-6_6

C. Fournet, J. Lévy, and A. Schmitt, An Asynchronous, Distributed Implementation of Mobile Ambients, Proc. IFIP TCS'00, 2000.
DOI : 10.1007/3-540-44929-9_26

P. Gardner, C. Laneve, and L. Wischik, The Fusion Machine, Proc. CONCUR '02, 2002.
DOI : 10.1007/3-540-45694-5_28

J. F. Groote and M. P. Sellink, Confluence for process verification, Theoretical Computer Science, vol.170, issue.12, 1996.

M. Hennessy, A Distributed Pi-Calculus, 2007.
DOI : 10.1017/CBO9780511611063

D. Hirschkoff, D. Pous, and D. Sangiorgi, A Correct Abstract Machine for Safe Ambients, Proc. COORD '05, 2005.
DOI : 10.1145/321879.321884

URL : https://hal.archives-ouvertes.fr/hal-01441466

S. Hym and M. Hennessy, Adding recursion to Dpi, Theoretical Computer Science, vol.373, issue.3, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00140654

A. Jeffrey and J. Rathke, A theory of bisimulation for a fragment of Concurrent ML with local names, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.1-3, 2004.
DOI : 10.1109/LICS.2000.855780

F. and L. Fessant, JoCaml: conception et implémentation d'un langagè a agents mobiles, 2001.

F. Levi and D. Sangiorgi, Mobile safe ambients, ACM Transactions on Programming Languages and Systems, vol.25, issue.1, 2003.
DOI : 10.1145/596980.596981

M. Merro and F. Nardelli, Bisimulation Proof Methods for Mobile Ambients, Proc. 30th ICALP, 2003.
DOI : 10.1007/3-540-45061-0_47

R. Milner, Communication and Concurrency, 1989.

R. D. Nicola, G. Ferrari, and R. Pugliese, KLAIM: a kernel language for agents interaction and mobility, IEEE Transactions on Software Engineering, vol.24, issue.5, 1998.
DOI : 10.1109/32.685256

A. Phillips, N. Yoshida, and S. Eisenbach, A Distributed Abstract Machine for Boxed Ambient Calculi, ESOP '04, 2004.
DOI : 10.1007/978-3-540-24725-8_12

D. Pous, Up-to Techniques for Weak Bisimulation, Proc. 32nd ICALP, 2005.
DOI : 10.1007/11523468_59

URL : https://hal.archives-ouvertes.fr/hal-01441463

D. Pous, On Bisimulation Proofs for the Analysis of Distributed Abstract Machines, Proc. TGC '06, 2006.
DOI : 10.1007/978-3-540-75336-0_10

URL : https://hal.archives-ouvertes.fr/hal-01441457

J. H. Reppy, CML: A higher-order concurrent language, Proc. PLDI. ACM, 1991.

D. Sangiorgi, On the Bisimulation Proof Method, Journal of Mathematical Structures in Computer Science, vol.8, 1998.

D. Sangiorgi and R. Milner, The problem of ???weak bisimulation up to???, Proc. 3rd CONCUR, 1992.
DOI : 10.1007/BFb0084781

D. Sangiorgi and A. Valente, A Distributed Abstract Machine for Safe Ambients, Proc. 28th ICALP, 2001.
DOI : 10.1007/3-540-48224-5_34

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

M. Shapiro, P. Dickman, and D. Plainfossé, Robust, distributed references and acyclic garbage collection, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing , PODC '92, 1992.
DOI : 10.1145/135419.135448

URL : https://hal.archives-ouvertes.fr/hal-01248225

R. E. Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM, vol.22, issue.2, 1975.
DOI : 10.1145/321879.321884

A. Unyapoth and P. Sewell, Nomadic pict: Correct Communication Infrastructure for Mobile Computation, Proc. 28th POPL, 2001.

V. Van-oostrom, Confluence by Decreasing Diagrams, Theoretical Computer Science, vol.126, issue.2, 1994.