{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:58Z","timestamp":1761611158530,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80295-6","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"57-70","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["On Equators in Asynchronous Name-passing Calculi without Matching \u2013 Extended Abstract \u2013"],"prefix":"10.1016","volume":"27","author":[{"given":"Massimo","family":"Merro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80295-6_BIB1","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB2","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF01191894","article-title":"An efficiency preorder for processes","volume":"29","author":"Arun-Kumar","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0304-3975(97)00220-X","article-title":"On the expressiveness of internal mobility in name-passing calculi","volume":"195","author":"Boreale","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB4","article-title":"Bisimulation in name-passing calculi without matching","author":"Boreale","year":"1998","journal-title":"in:13th LICS Conf."},{"key":"10.1016\/S1571-0661(05)80295-6_BIB5","series-title":"Technical Report RR-1702, INRIA-Sophia Antipolis","article-title":"Asynchrony and the \u03c0-calculus","author":"Boudol","year":"1992"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB6","article-title":"A Hierarchy of Equivalences for Asynchronous Calculi","volume":"1443","author":"Fournet","year":"1998","journal-title":"in:25th ICALP, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB7","series-title":"Technical Report 92-002, Keio University","article-title":"Two bisimilarities for the v-calculus","author":"Honda","year":"1992"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB8","doi-asserted-by":"crossref","unstructured":"Honda, K., Tokoro, M. \u201cAn Object Calculus for Asynchronous Communications.\u201d M., Tokoro, O., Nierstrasz, P., Wegner, and Yonezawa, A., ECOOP'91 Workshop on Object Based Concurrent Programming, Geneva, Switzerland, 1991, Lecture Notes in Computer Science 512 (1991), 133\u2013147","DOI":"10.1007\/BFb0057019"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB9","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB10","article-title":"On the Expressiveness of Chi, Update and Fusion calculi","volume":"16.2","author":"Merro","year":"1998","journal-title":"Proc. Express'98, Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB11","unstructured":"Merro, M., On Equators in Asynchronous Name-passing calculi without Matching, Technical Report available at http:\/\/www-sop.inria.fr\/meije\/personnel\/Massimo.Merro.html."},{"key":"10.1016\/S1571-0661(05)80295-6_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055108","article-title":"On asynchrony in name-passing calculi","volume":"1443","author":"Merro","year":"1998","journal-title":"25th ICALP, Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB13","series-title":"Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ. (1991)","article-title":"The polyadic \u03c0-calculus: a tutorial","author":"Milner","year":"1993"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes, (Parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB15","first-page":"685","article-title":"Barbed bisimulation","volume":"623","author":"Milner","year":"1992"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB16","series-title":"13th LICS Conf","article-title":"The fusion calculus: Expressiveness and symmetry in mobile processes","author":"Parrow","year":"1998"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB17","series-title":"Technical Report CSCI 476, Indiana University, to appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, MIT Press","article-title":"Pict: A programming language based on the pi-calculus","author":"Pierce","year":"1997"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB18","unstructured":"Sangiorgi, D., \u201cExpressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms,\u201d PhD thesis CST\u201399\u201393, Department of Computer Science, University of Edinburgh (1992)."},{"key":"10.1016\/S1571-0661(05)80295-6_BIB19","unstructured":"Sangiorgi, D., Lazy functions and mobile processes. Technical Report RR-2515, INRIA-Sophia Antipolis. 1995, to appear in Proof, Language and Interaction: Essays in Honour of Robin Milner, Gordon Plotkin, Colin Stirling, and Mads Tofte, MIT Press."},{"key":"10.1016\/S1571-0661(05)80295-6_BIB20","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80295-6_BIB21","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0055620","article-title":"Minimality and Separation Results on Asynchronous Mobile Processes: representability theorem by concurrent combinators","volume":"1466","author":"Yoshida","year":"1998","journal-title":"9th CONCUR. Lecture Notes in Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802956?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802956?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:41Z","timestamp":1761610061000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802956"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":21,"alternative-id":["S1571066105802956"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80295-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On Equators in Asynchronous Name-passing Calculi without Matching \u2013 Extended Abstract \u2013","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80295-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}