C. Bodei, L. Brodo, P. Degano, and H. Gao, Detecting and preventing type flaws at static time*, Journal of Computer Security, vol.18, issue.2, pp.229-264, 2010.
DOI : 10.3233/JCS-2010-0361

URL : http://doi.org/10.3233/jcs-2010-0361

C. Bodei, P. Degano, and C. Priami, Names of the ??-calculus agents handled locally, Theoretical Computer Science, vol.253, issue.2, pp.155-184, 2001.
DOI : 10.1016/S0304-3975(00)00093-1

F. Bonchi, F. Gadducci, and G. V. Monreale, Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding), Electronic Notes in Theoretical Computer Science, vol.242, issue.1, pp.73-98, 2009.
DOI : 10.1016/j.entcs.2009.06.014

F. Bonchi, F. Gadducci, and G. V. Monreale, Reactive Systems, Barbed Semantics, and the Mobile Ambients, FoSSaCS'09, pp.272-287, 2009.
DOI : 10.1007/978-3-540-71389-0_22

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Brodo, On the expressiveness of the pi-calculus and the mobile ambients. In: AMAST'10, LNCS, vol.6486, pp.44-59, 2011.

R. Bruni and I. Lanese, Parametric synchronizations in mobile nominal calculi, Theoretical Computer Science, vol.402, issue.2-3, pp.102-119, 2008.
DOI : 10.1016/j.tcs.2008.04.029

M. Carbone and S. Maffeis, On the expressive power of polyadic synchronisation in pi-calculus, Nordic Journal of Computing, vol.10, issue.2, pp.70-98, 2003.

L. Cardelli, Brane Calculi, LNCS, vol.80, issue.2, pp.257-278, 2005.
DOI : 10.1016/S0020-0190(01)00214-9

L. Cardelli and A. D. Gordon, Mobile ambients, Theoretical Computer Science, vol.240, issue.1, pp.177-213, 2000.
DOI : 10.1016/S0304-3975(99)00231-5

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

F. S. De-boer and C. Palamidessi, On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences, LNCS, vol.458, pp.99-114, 1990.
DOI : 10.1007/BFb0039054

G. L. Ferrari, U. Montanari, and E. Tuosto, A LTS Semantics of Ambients via Graph Synchronization with Mobility, LNCS, vol.2202, pp.1-16, 2001.
DOI : 10.1007/3-540-45446-2_1

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, pp.372-385, 1996.
DOI : 10.1145/237721.237805

A. Francalanza and M. Hennessy, A theory of system behaviour in the presence of node and link failure, Information and Computation, vol.206, issue.6, pp.711-759, 2008.
DOI : 10.1016/j.ic.2007.12.002

P. Gardner, C. Laneve, and L. Wischik, Linear forwarders, Information and Computation, vol.205, issue.10, pp.1526-1550, 2007.
DOI : 10.1016/j.ic.2007.01.006

URL : http://doi.org/10.1016/j.ic.2007.01.006

A. Gordon and L. Cardelli, Equational properties of mobile ambients, Mathematical Structures in Computer Science, vol.13, issue.3, pp.371-408, 2003.
DOI : 10.1017/S0960129502003742

R. Gorrieri and C. Versari, An operational petri net semantics for A 2 CCS, Fundam. Inform, vol.109, issue.2, pp.135-160, 2011.

D. Hausmann, T. Mossakowski, and L. Schröder, A coalgebraic approach to the semantics of the ambient calculus, Theoretical Computer Science, vol.366, issue.1-2, pp.121-143, 2006.
DOI : 10.1016/j.tcs.2006.07.006

C. Laneve and A. Vitale, The Expressive Power of Synchronizations, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.382-391, 2010.
DOI : 10.1109/LICS.2010.15

M. Merro and F. Z. Nardelli, Behavioral theory for mobile ambients, Journal of the ACM, vol.52, issue.6, pp.961-1023, 2005.
DOI : 10.1145/1101821.1101825

R. Milner, A Calculus of Communicating Systems, LNCS, vol.92, 1980.
DOI : 10.1007/3-540-10235-3

R. Milner, Communicating and mobile systems: the ?-calculus, CUP, 1999.

U. Montanari and M. Sammartino, Network conscious pi-calculus: a concurrent semantics, ENTCS, vol.286, pp.291-306, 2012.
DOI : 10.1016/j.entcs.2012.08.019

URL : http://doi.org/10.1016/j.entcs.2012.08.019

U. Nestmann, On the Expressive Power of Joint Input, Electronic Notes in Theoretical Computer Science, vol.16, issue.2, 1998.
DOI : 10.1016/S1571-0661(04)00123-9

R. D. Nicola, D. Gorla, and R. Pugliese, Basic observables for a calculus for global computing, Information and Computation, vol.205, issue.10, pp.1491-1525, 2007.
DOI : 10.1016/j.ic.2007.03.004

J. Rathke and P. Soboci´nskisoboci´nski, Deriving structural labelled transitions for mobile ambients, Information and Computation, vol.208, issue.10, pp.1221-1242, 2010.
DOI : 10.1016/j.ic.2010.06.001

F. W. Vaandrager, On the relationship between process algebra and input/output automata, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.387-398, 1991.
DOI : 10.1109/LICS.1991.151662

G. Winskel, Synchronization trees, Theoretical Computer Science, vol.34, issue.1-2, pp.33-82, 1984.
DOI : 10.1016/0304-3975(84)90112-9

URL : http://doi.org/10.1016/0304-3975(84)90112-9

L. Wischik and P. Gardner, Explicit fusions, Theoretical Computer Science, vol.340, issue.3, pp.606-630, 2005.
DOI : 10.1016/j.tcs.2005.03.017

URL : http://doi.org/10.1016/j.tcs.2005.03.017