Mobile Ambients with Timers and Types, Lecture Notes in Computer Science, vol.4711, pp.50-63, 2007. ,
DOI : 10.1007/978-3-540-75292-9_4
Timed Mobile Ambients for Network Protocols, Lecture Notes in Computer Science, vol.173, issue.1, pp.234-250, 2008. ,
DOI : 10.1007/3-540-45694-5_20
Bisimulation Can't Be Traced: Preliminary Report, 15th ACM Symposium on Principles of Programming Languages, pp.229-239, 1988. ,
DOI : 10.1145/73560.73580
URL : http://ecommons.cornell.edu/bitstream/1813/6990/1/90-1150.pdf
A Timed Linda Language and its Denotational Semantics, Fundamenta Informaticae, vol.63, 2004. ,
On Relating Time and Space to Size and Depth, SIAM Journal on Computing, vol.6, issue.4, pp.733-744, 1977. ,
DOI : 10.1137/0206054
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.1059
Access control for mobile agents, ACM Transactions on Programming Languages and Systems, vol.26, issue.1, pp.57-124, 2004. ,
DOI : 10.1145/963778.963781
URL : https://hal.archives-ouvertes.fr/hal-00152525
On the Computational Power of the Mate/Bud/Drip Brane Calculus: Interleaving vs. Maximal Parallelism, Lecture Notes in Computer Science, vol.3850, pp.144-158, 2006. ,
DOI : 10.1007/11603047_10
On the expressive power of movement and restriction in pure mobile ambients, Theoretical Computer Science, vol.322, issue.3, pp.477-515, 2004. ,
DOI : 10.1016/j.tcs.2003.10.040
Brane Calculi, Lecture Notes in Computer Science, vol.80, issue.2, pp.257-280, 2004. ,
DOI : 10.1016/S0020-0190(01)00214-9
Mobile ambients, Theoretical Computer Science, vol.240, issue.1, pp.177-213, 2000. ,
DOI : 10.1016/S0304-3975(99)00231-5
Finite-Control Mobile Ambients, Lecture Notes in Computer Science, vol.2305, pp.295-313, 2002. ,
DOI : 10.1007/3-540-45927-8_21
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.2483
Encoding Mobile Ambients into the ??-Calculus, Lecture Notes in Computer Science, vol.4378, pp.148-165, 2007. ,
DOI : 10.1007/978-3-540-70881-0_15
An Asynchronous, Distributed Implementation of Mobile Ambients, Lecture Notes in Computer Science, vol.1872, pp.348-364, 2000. ,
DOI : 10.1007/3-540-44929-9_26
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.8387
Computers and Intractability. A Guide to the Theory of NP-Completeness, 1979. ,
Using Ambients to Control Resources, Lecture Notes in Computer Science, vol.2421, pp.21-39, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00020253
Mobile safe ambients, ACM Transactions on Programming Languages and Systems, vol.25, issue.1, pp.1-69, 2003. ,
DOI : 10.1145/596980.596981
On the computational strength of pure ambient calculi, Theoretical Computer Science, vol.330, issue.3, pp.501-551, 2005. ,
DOI : 10.1016/j.tcs.2004.10.007
Communicating and Mobile Systems : the ?-Calculus, 1999. ,
The Space and Motion of Communicating Agents, 2009. ,
DOI : 10.1017/CBO9780511626661
Axioms for Concurrency, 1989. ,
Computational Complexity, 1995. ,
BioAmbients: an abstraction for biological compartments, Theoretical Computer Science, vol.325, issue.1, pp.141-167, 2004. ,
DOI : 10.1016/j.tcs.2004.03.061
URL : http://doi.org/10.1016/j.tcs.2004.03.061