{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:04Z","timestamp":1725460024488},"publisher-location":"Boston","reference-count":21,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_42","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T10:15:11Z","timestamp":1140516911000},"page":"549-562","source":"Crossref","is-referenced-by-count":2,"title":["Behavioural Theory for Mobile Ambients"],"prefix":"10.1007","author":[{"given":"Massimo","family":"Merro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco Zappa","family":"Nardelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R. Amadio","year":"1998","unstructured":"R. Amadio, I. Castellani, and D. Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science, 195:291\u2013324, 1998.","journal-title":"Theoretical Computer Science"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S. Arun-Kumar","year":"1992","unstructured":"S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29:737\u2013760, 1992.","journal-title":"Acta Informatica"},{"key":"42_CR3","unstructured":"M. Bugliesi, S. Crafa, M. Merro. V. Sassone. Communication interference in mobile boxed ambients. To appear in Information & Computation 2004, an extended abstract appeared in Proc. FSTTCS\u201902, LNCS, Springer Verlag."},{"key":"42_CR4","unstructured":"L. Cardelli and A. Gordon. A commitment relation for the ambient calculus. 1996."},{"issue":"1","key":"42_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"L. Cardelli and A. Gordon. Mobile ambients. Theoretical Computer Science, 240(1): 177\u2013213, 2000. An extended abstract appeared in Proc. of FoSSaCS\u2019 98.","journal-title":"Theoretical Computer Science"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"G. Castagna and F. Zappa Nardelli. The seal calculus revisited: Contextual equivalence and bisimilarity. In Proc. 22nd FSTTCS\u201902, LNCS. Springer Verlag, 2002.","DOI":"10.1007\/3-540-36206-1_9"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"G. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchro nization with mobility. In Proc. ICTCS, LNCS, 2001.","DOI":"10.1007\/3-540-45446-2_1"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"J.C. Godskesen, T. Hildebrandt, and V. Sassone. A calculus of mobile resources. In Proc. 10th CONCUR\u2019 02, LNCS, 2002.","DOI":"10.1007\/3-540-45694-5_19"},{"key":"42_CR9","first-page":"1","volume":"12","author":"A. D. Gordon","year":"2002","unstructured":"A. D. Gordon and L. Cardelli. Equational properties of mobile ambients. Journal of Mathematical Structures in CS, 12:1\u201338, 2002. Also in Proc. FoSSaCs\u2019 99.","journal-title":"Journal of Mathematical Structures in CS"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"M. Hennessy, M. Merro, and J. Rathke. Towards a behavioural theory of access and mobility control in distributed system. In Proc. 5th FoSSaCS\u201903, LNCS, 2003.","DOI":"10.1007\/3-540-36576-1_18"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"M. Hennessy, J. Rathke, and N. Yoshida. safedpi: a language for controlling mobile code. In Proc. FOSSACS 03, LNCS, 2003.","DOI":"10.1007\/978-3-540-24727-2_18"},{"key":"42_CR12","unstructured":"M. Hennessy and J. Riely. A typed language for distributed mobile processes. In Proc. 25th POPL. ACM Press, 1998."},{"issue":"2","key":"42_CR13","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"152","author":"K. Honda","year":"1995","unstructured":"K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437\u2013486, 1995.","journal-title":"Theoretical Computer Science"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"F. Levi and D. Sangiorgi. Controlling interference in ambients. An extended abstract appeared in Proc. 27th POPL, ACM Press, 2000.","DOI":"10.1145\/325694.325741"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. In Proc. 29th POPL, ACM Press, 2002.","DOI":"10.1145\/503272.503280"},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"M. Merro and F. Zappa Nardelli. Bisimulation proof methods for mobile ambients. In Proc. ICALP 2003, LNCS, Springer Verlag, 2003. An extended version is available as Computer Science Report 2003: 01, University of Sussex.","DOI":"10.1007\/3-540-45061-0_47"},{"key":"42_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Parts I and II). Information and Computation, 100: 1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"D. Sangiorgi. Extensionality and intensionality of the ambient logic. In Proc. 28th POPL, ACM Press, 2001.","DOI":"10.1145\/360204.375707"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"A. Unyapoth and P. Sewell. Nomadic Pict: Correct communication infrastructures for mobile computation. In Proc. 28th POPL. ACM Press, 2001.","DOI":"10.1145\/360204.360214"},{"key":"42_CR20","unstructured":"M. G. Vigliotti. Transition systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London), September 1999."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, LNCS, Pages 47\u201377, Springer Verlag, 1999.","DOI":"10.1007\/3-540-47959-7_3"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:28:22Z","timestamp":1619540902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_42","relation":{},"subject":[]}}