{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:56:12Z","timestamp":1743026172050,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020520"},{"type":"electronic","value":"9783642020537"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02053-7_7","type":"book-chapter","created":{"date-parts":[[2009,6,10]],"date-time":"2009-06-10T02:13:15Z","timestamp":1244599995000},"page":"123-142","source":"Crossref","is-referenced-by-count":0,"title":["Parametrised Constants and Replication for Spatial Mobility"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn","family":"Haagensen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"H\u00fcttel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-74792-5_9","volume-title":"Formal Methods for Components and Objects","author":"J. Aranda","year":"2007","unstructured":"Aranda, J., Di Giusto, C., Palamidessi, C., Valencia, F.D.: On Recursion, Replication and Scope Mechanisms in Process Calculi. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol.\u00a04709, pp. 185\u2013206. Springer, Heidelberg (2007)"},{"key":"7_CR2","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611063","volume-title":"A Distributed Pi-Calculus","author":"M. Hennessy","year":"2007","unstructured":"Hennessy, M.: A Distributed Pi-Calculus, 1st edn. Cambridge University Press, Cambridge (2007)","edition":"1"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.tcs.2006.12.017","volume":"373","author":"S. Hym","year":"2007","unstructured":"Hym, S., Hennessy, M.: Adding Recursion to Dpi. Theoretical Computer Science\u00a0373(3), 182\u2013212 (2007)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","unstructured":"Francalanza, A., Hennessy, M.: Location and Link Failure in a Distributed \u03c0-calculus. Sussex Technical Report 2005:01, University of Sussex (January 2005)"},{"issue":"1","key":"7_CR6","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.D.: Mobile Ambients. Theoretical Computer Science\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S1571-0661(05)80088-X","volume":"85","author":"A. Ravara","year":"2003","unstructured":"Ravara, A., Matos, A.G., Vasconcelos, V.T., Lopes, L.: Lexically scoped distribution: what you see is what you get. Electronic Notes in Theoretical Computer Science\u00a085(1), 61\u201379 (2003)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Levi, F., Sangiorgi, D.: Controlling Interference in Ambients. In: Symposium on Principles of Programming Languages, pp. 352\u2013364 (2000)","DOI":"10.1145\/325694.325741"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1006\/inco.2001.3089","volume":"173","author":"M. Hennessy","year":"2002","unstructured":"Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation\u00a0173, 82\u2013120 (2002)","journal-title":"Information and Computation"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11562436_25","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"A. Ciaffaglione","year":"2005","unstructured":"Ciaffaglione, A., Hennessy, M., Rathke, J.: Proof Methodologies for Behavioural Equivalence in DPI. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 335\u2013350. Springer, Heidelberg (2005)"},{"issue":"3","key":"7_CR11","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.tcs.2003.12.024","volume":"322","author":"M. Hennessy","year":"2004","unstructured":"Hennessy, M., Merro, M., Rathke, J.: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. Theoretical Computer Science\u00a0322(3), 615\u2013669 (2004)","journal-title":"Theoretical Computer Science"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Part I\/II. Information and Computation\u00a0100, 1\u201377 (1992)","journal-title":"Information and Computation"},{"key":"7_CR13","unstructured":"Sangiorgi, D.: Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. Ph.D thesis, University of Edinburgh, Dept. of Computer Science (1993)"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-540-85361-9_38","volume-title":"CONCUR 2008 - Concurrency Theory","author":"D. Gorla","year":"2008","unstructured":"Gorla, D.: Towards a Unified Approach to Encodability and Separation Results for Process Calculi. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 492\u2013507. Springer, Heidelberg (2008)"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11690634_4","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Gorla","year":"2006","unstructured":"Gorla, D.: On the Relative Expressive Power of Asynchronous Communication Primitives. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 47\u201362. Springer, Heidelberg (2006)"},{"issue":"1-3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0167-6423(91)90036-W","volume":"17","author":"M. Felleisen","year":"1991","unstructured":"Felleisen, M.: On the Expressive Power of Programming Languages. Science of Computer Programming\u00a017(1-3), 35\u201375 (1991)","journal-title":"Science of Computer Programming"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02053-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T14:33:28Z","timestamp":1552055608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02053-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020520","9783642020537"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02053-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}