{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:51Z","timestamp":1761610371781,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6053,"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":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80474-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"206-226","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["What is a 'Good' Encoding of Guarded Choice?"],"prefix":"10.1016","volume":"7","author":[{"given":"Uwe","family":"Nestmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80474-8_BIB1","doi-asserted-by":"crossref","unstructured":"R. M. Amadio, I. Castellani and D. Sangiorgi. On Bisimulations for the Asynchronous \u03c0-Calculus. In Proceedings of CONCUR '96, volume 1119 of LNCS, pages 147-162. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB2","doi-asserted-by":"crossref","unstructured":"R. M. Amadio. An Asynchronous Model of Locality, Failure, and Process Mobility. In Proceedings of COORDINATION '97, 1997. To appear.","DOI":"10.1007\/3-540-63383-9_92"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. In Proceedings of PODC '83, pages 27-30. 1983.","DOI":"10.1145\/800221.806707"},{"issue":"2","key":"10.1016\/S1571-0661(05)80474-8_BIB4","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1145\/357094.357101","article-title":"Output Guards and Nondeterminism in \u201cCommunicating Sequential Processes\u201d","volume":"2","author":"Bernstein","year":"1980","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB5","article-title":"On The Turing-Equivalence of Linda Coordination Primitives","author":"Busi","year":"1997","journal-title":"This volume"},{"issue":"2","key":"10.1016\/S1571-0661(05)80474-8_BIB6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00263584","article-title":"On the Existence of Symmetric Algorithms to Find Leaders in Networks of Communicating Sequential Processes","volume":"25","author":"Boug\u00e9","year":"1988","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB7","article-title":"Asynchrony and the \u03c0-calculus (Note)","author":"Boudol","year":"1992","journal-title":"Rapport de Recherche 1702, INRIA Sophia-Antipolis"},{"issue":"2","key":"10.1016\/S1571-0661(05)80474-8_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/69624.357208","article-title":"An Effective Implementation for the Generalized Input-Output Construct of CSP","volume":"5","author":"Buckley","year":"1983","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB9","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB10","doi-asserted-by":"crossref","unstructured":"C. Fournet and G. Gonthier. The Reflexive Chemical Abstract Machine and the Join-Calculus. In Proceedings of POPL '96, pages 372-385. 1996.","DOI":"10.1145\/237721.237805"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB11","unstructured":"K. Honda. Notes on Soundness of a Mapping from \u03c0-calculus to v-calculus. With comments added in October 1993, May 1992."},{"key":"10.1016\/S1571-0661(05)80474-8_BIB12","series-title":"Object-Based Concurrent Computing 1991, volume 612 of LNCS","first-page":"21","article-title":"On Asynchronous Communication Semantics","author":"Honda","year":"1992"},{"issue":"5","key":"10.1016\/S1571-0661(05)80474-8_BIB13","first-page":"475","article-title":"A Distributed Protocol for Channel-Based Communication with Choice","volume":"12","author":"Knabe","year":"1993","journal-title":"Computers and Artificial Intelligence"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB14","doi-asserted-by":"crossref","unstructured":"N. Kobayashi. A Partially Deadlock-Free Typed Process Calculus. In Proceedings of LICS '97, pages 128-139. Computer Society Press, 1997.","DOI":"10.1109\/LICS.1997.614941"},{"issue":"287","key":"10.1016\/S1571-0661(05)80474-8_BIB15","article-title":"A Counter-Example to an Algorithm for the Generalized Input-Output Construct of CSP","volume":"61","author":"Kumar","year":"1997","journal-title":"Information Processing Letters"},{"issue":"8","key":"10.1016\/S1571-0661(05)80474-8_BIB16","first-page":"453","article-title":"A New Solution of Dijkstra's Concurrent Programming Problem","volume":"17","author":"Lamport","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB17","doi-asserted-by":"crossref","unstructured":"D. Lehmann and M. O. Rabin. On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem. In Proceedings of POPL '81, pages 133-138. ACM, 1981.","DOI":"10.1145\/567532.567547"},{"issue":"3","key":"10.1016\/S1571-0661(05)80474-8_BIB18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/BF01211076","article-title":"Some Facile Chemistry","volume":"7","author":"Leth","year":"1995","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB19","doi-asserted-by":"crossref","unstructured":"R. Milner. The Polyadic \u03c0-Calculus: A Tutorial. In Proceedings of Logic and Algebra of Specification, International NATO Summer School (Marktoberdorf, Germany, 1991). Springer, 1993.","DOI":"10.1007\/978-3-642-58041-3_6"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A Calculus of Mobile Processes, Part I\/II","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB21","doi-asserted-by":"crossref","unstructured":"R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proceedings of ICALP '92, volume 623 of LNCS, pages 685-695. Springer, 1992.","DOI":"10.1007\/3-540-55719-9_114"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB22","unstructured":"U. Nestmann. On Determinacy and Nondeterminacy in Concurrent Programming. PhD thesis, Universit\u00e4t Erlangen, November 1996."},{"key":"10.1016\/S1571-0661(05)80474-8_BIB23","doi-asserted-by":"crossref","unstructured":"U. Nestmann and B. C. Pierce. Decoding Choice Encodings. In Proceedings of CONCUR '96, volume 1119 of LNCS, pages 179-194. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_55"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB24","doi-asserted-by":"crossref","unstructured":"C. Palamidessi. Comparing the Expressive Power of the Synchronous and the Asynchronous \u03c0-calculus. In Proceedings of POPL '97, pages 256-265. 1997.","DOI":"10.1145\/263699.263731"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB25","doi-asserted-by":"crossref","unstructured":"J. Reppy. CML: A Higher-Order Concurrent Language. In Proceedings of PLDI '91, pages 293-259. ACM, June 1991. In SIGPLAN Notices 26(6).","DOI":"10.1145\/113446.113470"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB26","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras \u2014 First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993."},{"key":"10.1016\/S1571-0661(05)80474-8_BIB27","doi-asserted-by":"crossref","unstructured":"B. Thomsen, L. Leth and T.-M. Kuo. A Facile Tutorial. In Proceedings of CONCUR '96, volume 1119 of LNCS, pages 278-298. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_61"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB28","doi-asserted-by":"crossref","unstructured":"B. Victor and J. Parrow. Constraints as Processes. In Proceedings of CONCUR '96, volume 1119 of LNCS, pages 389-405. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_66"},{"key":"10.1016\/S1571-0661(05)80474-8_BIB29","doi-asserted-by":"crossref","unstructured":"N. Yoshida. Graph Types for Monadic Mobile Processes. In Proceedings of FSTTCS '96, volume 1180 of LNCS, pages 371-386. Springer, 1996.","DOI":"10.1007\/3-540-62034-6_64"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804748?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804748?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:00Z","timestamp":1761610020000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804748"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":29,"alternative-id":["S1571066105804748"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80474-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"What is a 'Good' Encoding of Guarded Choice?","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)80474-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}