{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:50Z","timestamp":1760202470781},"reference-count":67,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":5160,"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":[[1999,6]]},"DOI":"10.1016\/s0304-3975(99)00037-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"327-368","source":"Crossref","is-referenced-by-count":23,"title":["Variations on mobile processes"],"prefix":"10.1016","volume":"221","author":[{"given":"Yuxi","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00037-7_bib1","series-title":"Declarative Programming","first-page":"65","article-title":"The Lazy Lambda calculus","author":"Abramsky","year":"1988"},{"key":"10.1016\/S0304-3975(99)00037-7_bib2","series-title":"Proc. 1st Imperial College Department of Computing Workshop on Theory and Formal Methods","first-page":"57","article-title":"Interaction categories","author":"Abramsky","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","article-title":"Computational interpretations of linear logic","volume":"111","author":"Abramsky","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(94)00103-0","article-title":"Proofs as processes","volume":"135","author":"Abramsky","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib5","series-title":"A Classical Mind: Essays in Honour of C.A.R. Hoare","first-page":"1","article-title":"Interaction categories and communicating sequential processes","author":"Abramsky","year":"1994"},{"key":"10.1016\/S0304-3975(99)00037-7_bib6","series-title":"Proc. 1994 Marktoberdorf Summer School on Deductive Program Design","article-title":"Interaction categories and the foundations of typed concurrent programming","author":"Abramsky","year":"1996"},{"key":"10.1016\/S0304-3975(99)00037-7_bib7","series-title":"CONCUR'96","first-page":"146","article-title":"On bisimulations for the asynchronous \u03c0-calculus","volume":"vol. 1119","author":"Amadio","year":"1996"},{"key":"10.1016\/S0304-3975(99)00037-7_bib8","series-title":"Studies in Logic and Foundations of Mathematics","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)71818-4","article-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0304-3975(99)00037-7_bib9","article-title":"*-Autonomous Categories","volume":"vol. 752","author":"Barr","year":"1979"},{"key":"10.1016\/S0304-3975(99)00037-7_bib10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1017\/S0960129500001274","article-title":"*-Autonomous categories and linear logic","volume":"1","author":"Barr","year":"1991","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0304-3975(94)00104-9","article-title":"On the \u03c0-calculus and linear logic","volume":"135","author":"Bellin","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib13","series-title":"CONCUR'96","first-page":"161","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)00037-7_bib14","series-title":"CONCUR'92","first-page":"2","article-title":"Testing equivalence for mobile processes","volume":"vol. 630","author":"Boreale","year":"1992"},{"key":"10.1016\/S0304-3975(99)00037-7_bib15","article-title":"Asynchrony and \u03c0-calculus","author":"Boudol","year":"1991"},{"key":"10.1016\/S0304-3975(99)00037-7_bib16","series-title":"Proc. Internat. Conf. on Advances in Parallel and Distributed Computing","first-page":"74","article-title":"The \u03c7-calculus","author":"Fu","year":"1997"},{"key":"10.1016\/S0304-3975(99)00037-7_bib17","series-title":"ICALP'97","first-page":"325","article-title":"A proof theoretical approach to communications","volume":"vol. 1256","author":"Fu","year":"1997"},{"key":"10.1016\/S0304-3975(99)00037-7_bib18","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1007\/BF02946493","article-title":"Reaction graph","volume":"13","author":"Fu","year":"1998","journal-title":"J. Comput. Sci. Technol."},{"key":"10.1016\/S0304-3975(99)00037-7_bib19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/BF02943188","article-title":"Symmetric \u03c0-calculus","volume":"13","author":"Fu","year":"1998","journal-title":"J. Comput. Sci. Technol."},{"key":"10.1016\/S0304-3975(99)00037-7_bib20","series-title":"ASIAN'98","first-page":"245","article-title":"Bisimulation lattice of Chi processes","volume":"vol. 1538","author":"Fu","year":"1998"},{"key":"10.1016\/S0304-3975(99)00037-7_bib21","article-title":"Linear types for communicating processes","author":"Gay","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_bib22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib23","series-title":"Categories in Computer Science and Logic","first-page":"69","article-title":"Towards a geometry of interaction","volume":"vol. 92","author":"Girard","year":"1989"},{"key":"10.1016\/S0304-3975(99)00037-7_bib24","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","article-title":"Symbolic bisimulations","volume":"138","author":"Hennessy","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib25","series-title":"ECOOP'91","first-page":"133","article-title":"An object calculus for asynchronous communication","volume":"vol. 512","author":"Honda","year":"1991"},{"key":"10.1016\/S0304-3975(99)00037-7_bib26","first-page":"21","article-title":"On asynchronous communication semantics, Object-Based Concurrent Computing","volume":"vol. 612","author":"Honda","year":"1991"},{"key":"10.1016\/S0304-3975(99)00037-7_bib27","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","article-title":"On reduction based process semantics","volume":"152","author":"Honda","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib28","series-title":"POPL'90","first-page":"95","article-title":"Interaction nets","author":"Lafont","year":"1990"},{"key":"10.1016\/S0304-3975(99)00037-7_bib29","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2643","article-title":"Interaction combinators","volume":"137","author":"Lafont","year":"1997","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00037-7_bib30","series-title":"Proc. 6th Internat. Joint Conf. on the Theory and Practice of Software Development","first-page":"187","article-title":"Complete inference systems for weak bisimulation equivalences in the \u03c0-calculus","volume":"vol. 915","author":"Lin","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_bib31","series-title":"CONCUR'95","first-page":"88","article-title":"Unique fixpoint induction for mobile processes","volume":"vol. 962","author":"Lin","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_bib32","series-title":"ICALP'98","first-page":"443","article-title":"Complete proof systems for observation congruences in finite-control \u03c0-calculus","volume":"vol. 1443","author":"Lin","year":"1998"},{"key":"10.1016\/S0304-3975(99)00037-7_bib33","series-title":"LICS'95","first-page":"188","article-title":"Control structure","author":"Mifsud","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_bib34","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00037-7_bib35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"2","author":"Milner","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib36","series-title":"Proc. Marktoberdorf Summer School on Logic and Algebra of Specification","article-title":"The polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib37","series-title":"MFCS'93","first-page":"105","article-title":"Action calculi, or syntactic action structure","volume":"vol. 711","author":"Milner","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib38","series-title":"ESOP'94","first-page":"26","article-title":"\u03c0-nets: a graphical form of \u03c0-calculus","volume":"vol. 788","author":"Milner","year":"1994"},{"key":"10.1016\/S0304-3975(99)00037-7_bib39","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s002360050067","article-title":"Calculi for interaction","volume":"33","author":"Milner","year":"1995","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00037-7_bib40","series-title":"Proc. 1993 Marktoberdorf Summer School on Proof and Computation","article-title":"Action structures and the \u03c0-calculus","author":"Milner","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_SB0205","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)00037-7_SB0210","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00037-7_bib42","series-title":"ICALP'92","first-page":"685","article-title":"Barbed bisimulation","volume":"vol. 623","author":"Milner","year":"1992"},{"key":"10.1016\/S0304-3975(99)00037-7_bib43","article-title":"The Lazy Lambda calculus: an investigation into the foundations of functional programming","author":"Ong","year":"1988"},{"key":"10.1016\/S0304-3975(99)00037-7_bib44","first-page":"561","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 154","author":"Park","year":"1981"},{"key":"10.1016\/S0304-3975(99)00037-7_bib45","first-page":"477","article-title":"Interaction diagrams, A Decade of Concurrency","volume":"vol. 803","author":"Parrow","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib46","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1006\/inco.1995.1108","article-title":"Algebraic theories for name-passing calculi","volume":"120","author":"Parrow","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00037-7_bib47","series-title":"AMAST'97","first-page":"389","article-title":"The update calculus","volume":"vol. 1119","author":"Parrow","year":"1997"},{"key":"10.1016\/S0304-3975(99)00037-7_bib48","series-title":"LICS'98","first-page":"176","article-title":"The fusion calculus: expressiveness and symmetry in mobile processes","author":"Parrow","year":"1998"},{"key":"10.1016\/S0304-3975(99)00037-7_bib49","series-title":"CONCUR'98","first-page":"99","article-title":"The Tau-Laws of fusion","volume":"vol. 1466","author":"Parrow","year":"1998"},{"key":"10.1016\/S0304-3975(99)00037-7_bib50","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","article-title":"Call-by name, call-by-value and the \u03bb-calculus","volume":"1","author":"Plotkin","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib51","article-title":"Expressing mobility in process algebras: first-order and higher-order paradigms","author":"Sangiorgi","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib52","series-title":"TAPSOFT'93","first-page":"151","article-title":"From \u03c0-calculus to higher order \u03c0-calculus \u2014 and back","volume":"vol. 668","author":"Sangiorgi","year":"1993"},{"key":"10.1016\/S0304-3975(99)00037-7_bib53","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1006\/inco.1994.1042","article-title":"The Lazy Lambda calculus in a concurrency scenario","volume":"111","author":"Sangiorgi","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00037-7_bib54","article-title":"Lazy functions and mobile processes","author":"Sangiorgi","year":"1995"},{"key":"10.1016\/S0304-3975(99)00037-7_bib55","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0304-3975(96)00075-8","article-title":"\u03c0-calculus, internal mobility and agent-passing calculi","volume":"167","author":"Sangiorgi","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00037-7_bib56","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s002360050036","article-title":"A theory of bisimulation for \u03c0-calculus","volume":"3","author":"Sangiorgi","year":"1996","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00037-7_bib57","series-title":"CONCUR'92","article-title":"Techniques of \u201cweak bisimulation up to\u201d","volume":"vol. 630","author":"Sangiorgi","year":"1992"},{"key":"10.1016\/S0304-3975(99)00037-7_bib58","series-title":"Categories in Computer Science and Logic","first-page":"371","article-title":"Linear Logic, *-Autonomous categories and Cofree coalgebras","volume":"vol. 92","author":"Seely","year":"1989"},{"key":"10.1016\/S0304-3975(99)00037-7_bib59","article-title":"Proof Theory","volume":"vol. 81","author":"Takeuti","year":"1975"},{"key":"10.1016\/S0304-3975(99)00037-7_bib60","series-title":"POPL'89","first-page":"143","article-title":"A calculus of higher order communicating systems","author":"Thomsen","year":"1989"},{"key":"10.1016\/S0304-3975(99)00037-7_bib61","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01200262","article-title":"Plain CHOCS \u2014 a second generation calculus for higher order processes","volume":"30","author":"Thomsen","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(99)00037-7_bib62","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1006\/inco.1995.1004","article-title":"A theory of higher order communicating systems","volume":"116","author":"Thomsen","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00037-7_bib63","article-title":"Lectures on Linear Logic","author":"Troelstra","year":"1992","journal-title":"CSLI Lecture Notes"},{"key":"10.1016\/S0304-3975(99)00037-7_bib64","series-title":"ICALP'98","first-page":"455","article-title":"Concurrent constraints in the fusion calculus","volume":"vol. 1443","author":"Victor","year":"1998"},{"key":"10.1016\/S0304-3975(99)00037-7_bib65","series-title":"TACS'91","first-page":"532","article-title":"\u03c0-Calculus semantics for object-oriented programming languages","volume":"vol. 526","author":"Walker","year":"1991"},{"key":"10.1016\/S0304-3975(99)00037-7_bib66","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/inco.1995.1018","article-title":"Objects in the \u03c0-calculus","volume":"116","author":"Walker","year":"1995","journal-title":"Inform. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000377?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000377?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:21:12Z","timestamp":1555406472000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000377"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":67,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S0304397599000377"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00037-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}