T. Amtoft, A. J. Kfoury, and S. M. Pericás-geertsen, What Are Polymorphically-Typed Ambients?, 10th European Symposium on Programming LNCS 2028, pp.206-220, 2001.
DOI : 10.1007/3-540-45309-1_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1488

M. Bugliesi, G. Castagna, and S. Crafa, Boxed Ambients, Theoretical Aspects of Computer Software LNCS 2215, 2001.
DOI : 10.1007/3-540-45500-0_2
URL : https://hal.archives-ouvertes.fr/hal-00152525

N. Busi and G. Zavattaro, On the Expressiveness of Movement in Pure Mobile Ambients, Foundations of Wide Area Network Computing, 2002.
DOI : 10.1016/S1571-0661(04)80414-6

L. Cardelli and A. D. Gordon, Anytime, anywhere, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '00, pp.365-377, 2000.
DOI : 10.1145/325694.325742

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

W. Charatonik, A. D. Gordon, and J. Talbot, Finite-Control Mobile Ambients, European Symposium on Programming (ESOP'02), LNCS 2305, pp.295-313, 2002.
DOI : 10.1007/3-540-45927-8_21

W. Charatonik and J. Talbot, The Decidability of Model Checking Mobile Ambients, Computer Science Logic (CSL'01), pp.339-354, 2001.
DOI : 10.1007/3-540-44802-0_24

S. and D. Zilio, Spatial congruence for ambients is decidable, 6th Asian Computing Science Conference, pp.88-103, 1961.

J. Feret, Abstract Interpretation-Based Static Analysis of Mobile Ambients, Eighth International Static Analysis Symposium (SAS'01), LNCS 2126, 2001.
DOI : 10.1007/3-540-47764-0_24
URL : https://hal.archives-ouvertes.fr/inria-00527929

A. D. Gordon and L. Cardelli, Equational properties of mobile ambients, Mathematical Structures in Computer Science, vol.12, pp.1-38, 2002.
DOI : 10.1007/3-540-49019-1_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.7275

R. R. Hansen, J. G. Jensen, F. Nielson, and H. Nielson, Abstract interpretation of mobile ambients, Static Analysis (SAS'99), pp.134-148, 1999.

D. Hirschkoff, Mise en oeuvre de preuves de bisimulation, Ecole Nationale des Ponts et Chaussées, 1999.

D. Hirschkoff, E. Lozes, and D. Sangiorgi, Separability, expressiveness, and decidability in the ambient logic, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, pp.423-432, 2002.
DOI : 10.1109/LICS.2002.1029850

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

E. W. Mayr, An Algorithm for the General Petri Net Reachability Problem, SIAM Journal on Computing, vol.13, issue.3, pp.441-460, 1984.
DOI : 10.1137/0213029

R. Milner, J. Parrow, and J. Walker, A calculus of mobile processes, I and II. Information and Computation, pp.1-4041, 1992.

M. Minsky, Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines, The Annals of Mathematics, vol.74, issue.3, pp.437-455, 1961.
DOI : 10.2307/1970290

F. Nielson, H. R. Nielson, R. R. Hansen, and J. G. Jensen, Validating Firewalls in Mobile Ambients, Concurrency Theory (Concur'99), pp.463-477, 1999.
DOI : 10.1007/3-540-48320-9_32

D. Teller, P. Zimmer, and D. Hirschkoff, Using ambients to control resources, CONCUR 2002?Concurrency Theory, pp.288-303, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00020253

P. Zimmer, On the expressiveness of pure safe ambients, Mathematical Structures in Computer Science, vol.13, issue.5, 2002.
DOI : 10.1017/S0960129503004079
URL : https://hal.archives-ouvertes.fr/inria-00072238