{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T23:10:09Z","timestamp":1744499409120},"reference-count":40,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00230-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:42:30Z","timestamp":1027636950000},"page":"147-176","source":"Crossref","is-referenced-by-count":13,"title":["On modelling mobility"],"prefix":"10.1016","volume":"240","author":[{"given":"Roberto M.","family":"Amadio","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00230-3_BIB1","series-title":"Actors","author":"Agha","year":"1986"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB2","article-title":"Specifying and analyzing dynamic software architectures","volume":"Vol. 1328","author":"Allen","year":"1998"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB3","doi-asserted-by":"crossref","unstructured":"R. Amadio, An asynchronous model of locality, failure, and process mobility, in: Proc. Coordination 97, Lecture Notes in Computer Science, Vol. 1282, Springer, Berlin, 1997. Extended version appeared as RR-INRIA 3109.","DOI":"10.1007\/3-540-63383-9_92"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","article-title":"On bisimulations for the asynchronous \u03c0-calculus","volume":"195","author":"Amadio","year":"1998","journal-title":"J. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB5","first-page":"106","article-title":"From a concurrent \u03bb-calculus to the \u03c0-calculus","volume":"Vol. 965","author":"Amadio","year":"1995"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB6","doi-asserted-by":"crossref","unstructured":"R. Amadio, S. Prasad, Localities and failures (extended summary). in: Proc. FST-TCS94, Lecture Notes in Computer Science, Vol. 880, Springer, Berlin, 1994, pp. 205\u2013216. Extended version available at http:\/\/protis.univ-mrs.fr\/\u223camadio\/.","DOI":"10.1007\/3-540-58715-2_126"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB7","doi-asserted-by":"crossref","unstructured":"R. Amadio, S. Prasad, Modelling IP mobility, in: Proc. CONCUR98, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 301\u2013316. Expanded version available at http:\/\/protis.univ-mrs.fr\/\u223camadio.","DOI":"10.1007\/BFb0055630"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB8","series-title":"Concurrent Programming in Erlang","author":"Armstrong","year":"1996"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB9","series-title":"The Java Programming Language","author":"Arnold","year":"1997"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB10","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","article-title":"Renaming in an asynchronous environment","volume":"37","author":"Attiya","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB11","article-title":"On the expressiveness of internal mobility in name passing calculi","volume":"Vol. 1119","author":"Boreale","year":"1996"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB12","unstructured":"G. Boudol, Asynchrony and the \u03c0-calculus, Tech. Report, RR 1702, INRIA, Sophia-Antipolis, 1992."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB13","doi-asserted-by":"crossref","unstructured":"G. Boudol, Some chemical abstract machines, Proc. of REX School, Lecture Notes in Computer Science, Vol. 803, Springer, Berlin, 1993.","DOI":"10.1007\/3-540-58043-3_18"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB14","doi-asserted-by":"crossref","unstructured":"L. Cardelli, Obliq: a language with distributed scope, Proc. ACM Principles of Prog. Lang., 1995.","DOI":"10.1145\/199448.199516"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB15","article-title":"Mobile ambients","volume":"Vol. 1378","author":"Cardelli","year":"1998"},{"issue":"4","key":"10.1016\/S0304-3975(99)00230-3_BIB16","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1145\/234533.234549","article-title":"The weakest failure detector for solving consensus","volume":"43","author":"Chandra","year":"1996","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/S0304-3975(99)00230-3_BIB17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","article-title":"Unreliable failure detectors for reliable distributed systems","volume":"43","author":"Chandra","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB18","doi-asserted-by":"crossref","unstructured":"U. Engberg, M. Nielsen, A calculus of communicating systems with label passing, Tech. Report, PB-208, Aarhus Computer Science Department, 1986.","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB19","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consenus with one faulty process","volume":"32","author":"Fischer","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB20","doi-asserted-by":"crossref","unstructured":"C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, Proc. ACM Principles of Prog. Lang., 1996.","DOI":"10.1145\/237721.237805"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB21","article-title":"A calculus of mobile agents","volume":"Vol. 1119","author":"Fournet","year":"1996"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB22","unstructured":"M. Hennessy, J. Riely, A typed language for distributed mobile processes, Proc. ACM Principles of Prog. Lang., ACM, New York, 1998."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB23","doi-asserted-by":"crossref","unstructured":"K. Honda, M. Tokoro. An object calculus for asynchronous communication, Proc. ECOOP 91, Geneve, 1991.","DOI":"10.1007\/BFb0057019"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB24","series-title":"Bisimulation and fault-tolerance, Ph.D. Thesis","author":"Janowski","year":"1995"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB25","doi-asserted-by":"crossref","unstructured":"D. Johnson, C. Perkins, Mobility support in IPv6 (RFC). Version expiring May 97, 1996.","DOI":"10.1145\/236387.236400"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB26","doi-asserted-by":"crossref","unstructured":"N. Kobayashi, B. Pierce, D. Turner, Linearity in the \u03c0-calculus, Proc. ACM Principles of Prog. Lang., 1996.","DOI":"10.1145\/237721.237804"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB27","doi-asserted-by":"crossref","unstructured":"F. Le Fessant, L. Maranget, Compiling join patterns, Electronic Notes in TCS, (1998) 16\u201313.","DOI":"10.1016\/S1571-0661(04)00143-4"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB28","doi-asserted-by":"crossref","unstructured":"D. Le Metayer, Software architectures styles as graph grammars, Proc. ACM Symp. on the Foundations of Software Engineering, 1996.","DOI":"10.1145\/239098.239105"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB29","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Representation of switching circuits by binary decision diagrams","volume":"38","author":"Lee","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB30","unstructured":"N. Lynch, Distributed Algorithms, Kaufmann, 1996."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB31","doi-asserted-by":"crossref","unstructured":"J. Magee, J. Kramer. Dynamic structure in software architecture, Proc. ACM Symp. on the Foundations of Software Engineering, 1996.","DOI":"10.1145\/239098.239104"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB32","unstructured":"General Magic, The telescript programming guide. http:\/\/www.genmagic.com, 1997."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB33","doi-asserted-by":"crossref","unstructured":"M. Merro, D. Sangiorgi, On asynchrony in name passing calculi. Proc. ICALP98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.","DOI":"10.1007\/BFb0055108"},{"issue":"1","key":"10.1016\/S0304-3975(99)00230-3_BIB34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB35","doi-asserted-by":"crossref","unstructured":"B. Pierce, D. Sangiorgi, Typing and subtyping for mobile processes, Proc. IEEE Logic in Comp. Sci., 1993.","DOI":"10.1109\/LICS.1993.287570"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB36","unstructured":"D. Sangiorgi, The name discipline of uniform receptiveness, Proc. ICALP 97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB37","article-title":"The Oz programming model","volume":"Vol. 1000","author":"Smolka","year":"1995"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB38","series-title":"Introduction to Distributed Algorithms","author":"Tel","year":"1995"},{"key":"10.1016\/S0304-3975(99)00230-3_BIB39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","article-title":"Plain Chocs","volume":"30","author":"Thomsen","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00230-3_BIB40","unstructured":"B. Thomsen, L. Leth, S. Prasad, T.M. Kuo, A. Kramer, F. Knabe, A. Giacalone, Facile Antigua release programming guide, Techn. Report, TR 93-20, ECRC, Munich, 1993."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002303?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:29:50Z","timestamp":1580858990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002303"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00230-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}