{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:10Z","timestamp":1761611230629},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_9","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T06:48:17Z","timestamp":1221634097000},"page":"115-130","source":"Crossref","is-referenced-by-count":5,"title":["A Decentralized Implementation of Mobile Ambients"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giacoma Valentina","family":"Monreale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. Theor.Comp.Sci.\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theor.Comp.Sci."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.tcs.2004.03.061","volume":"325","author":"A. Regev","year":"2004","unstructured":"Regev, A., Panina, E., Silverman, W., Cardelli, L., Shapiro, E.: Bioambients: an abstraction for biological compartments. Theor.Comp.Sci.\u00a0325(1), 141\u2013167 (2004)","journal-title":"Theor.Comp.Sci."},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0890-5401(03)00137-8","volume":"186","author":"L. Caires","year":"2003","unstructured":"Caires, L., Cardelli, L.: A spatial logic for concurrency (part I). Information and Computation\u00a0186(2), 194\u2013235 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jlap.2007.02.003","volume":"71","author":"D. Hirschkoff","year":"2007","unstructured":"Hirschkoff, D., Pous, D., Sangiorgi, D.: An efficient abstract machine for safe ambients. Journal of Logic and Algebraic Programming\u00a071(2), 114\u2013149 (2007)","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1017\/S096012950700610X","volume":"17","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F.: Graph rewriting for the \u03c0-calculus. Mathematical Structures in Computer Science\u00a017(3), 407\u2013437 (2007)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2005.07.003","volume":"204","author":"R. Milner","year":"2006","unstructured":"Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation\u00a0204(1), 60\u2013122 (2006)","journal-title":"Information and Computation"},{"key":"9_CR7","series-title":"Electr.Notes in Theor.Comp.Sci.","volume-title":"Mathematical Foundations of Programming Semantics","author":"F. Gadducci","year":"2001","unstructured":"Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) Mathematical Foundations of Programming Semantics. Electr.Notes in Theor.Comp.Sci., vol.\u00a045. Elsevier Science, Amsterdam (2001)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45446-2_1","volume-title":"Theoretical Computer Science","author":"G. Ferrari","year":"2001","unstructured":"Ferrari, G., Montanari, U., Tuosto, E.: A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol.\u00a02202, pp. 1\u201316. Springer, Heidelberg (2001)"},{"key":"9_CR9","series-title":"ENTCS","first-page":"335","volume-title":"Rewriting Logic and its Applications","author":"P. Cenciarelli","year":"2005","unstructured":"Cenciarelli, P., Talamo, I., Tiberi, A.: Ambient graph rewriting. In: Mart\u00ec-Oliet, N. (ed.) Rewriting Logic and its Applications. ENTCS, vol.\u00a0117, pp. 335\u2013351. Elsevier, Amsterdam (2005)"},{"key":"9_CR10","unstructured":"Mylonakis, N., Orejas, F.: Another fully abstract graph semantics for the ambient calculus. Graph Transformation for Verification and Concurrency (2007)"},{"key":"9_CR11","unstructured":"Jensen, O., Milner, R.: Bigraphs and mobile processes. Technical Report 580, Computer Laboratory, University of Cambridge (2003)"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/596980.596981","volume":"25","author":"F. Levi","year":"2003","unstructured":"Levi, F., Sangiorgi, D.: Mobile safe ambients. ACM Trans. Program. Lang. Syst.\u00a025(1), 1\u201369 (2003)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"6","key":"9_CR13","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1145\/1101821.1101825","volume":"52","author":"M. Merro","year":"2005","unstructured":"Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. Journal of the ACM\u00a052(6), 961\u20131023 (2005)","journal-title":"Journal of the ACM"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(01)00318-8","volume":"286","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Gadducci, F., Montanari, U.: Normal forms for algebras of connections. Theor.Comp.Sci.\u00a0286(2), 247\u2013292 (2002)","journal-title":"Theor.Comp.Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1008647417502","volume":"7","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures\u00a07, 299\u2013331 (1999)","journal-title":"Applied Categorical Structures"},{"issue":"3\/4","key":"9_CR16","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026(3\/4), 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/9789812384720_0003","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"9_CR18","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1142\/9789812384720_0002","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"F. Drewes","year":"1997","unstructured":"Drewes, F., Habel, A., Kreowski, H.J.: Hyperedge replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 95\u2013162. World Scientific, Singapore (1997)"},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science\u00a016(6), 1133\u20131163 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:37:40Z","timestamp":1606167460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}