{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:43Z","timestamp":1761610423300,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5688,"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":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80248-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"24-45","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"special_numbering":"C","title":["Faithful \u03c0-nets."],"prefix":"10.1016","volume":"18","author":[{"given":"Gabriel","family":"Ciobanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihai","family":"Rotaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80248-8_BIBACS96","doi-asserted-by":"crossref","unstructured":"Roberto Amadio, Ilaria Castellani, Davide Sangiorgi. On bisimulations for the asynchronous \u03c0-calculus. Proceedings CONCUR'96, LNCS 1119, pages 147-162, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBBOU91","article-title":"Asynchrony and the \u03c0-calculus","author":"G\u00e9ard Boudol","year":"1991","journal-title":"Research Report 1702, INRIA Sophia-Antipolis"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBCR97","unstructured":"Gabriel Ciobanu, Mihai Rotaru. A faithful graphical representation for \u03c0-calculus. Proceedings 11th Conference on Control Systems and Computers Science, vol. II, pages 149-155, Bucharest, 1997."},{"key":"10.1016\/S1571-0661(05)80248-8_BIBHT91","doi-asserted-by":"crossref","unstructured":"Kohei Honda, Mario Tokoro. An object calculus for asynchronous communication. Proceedings ECOOP'91, LNCS 512, pages 133-147, Springer-Verlag, 1991.","DOI":"10.1007\/BFb0057019"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBHY95","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","article-title":"On reduction-based process semantics","volume":"vol.151","author":"Honda","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBMIL91","unstructured":"Robin Milner. The polyadic \u03c0-calculus: a tutorial, ECS-LFCS Report Series 91-180, Laboratory for Foundations of Computer Science, University of Edinburgh, 1991."},{"issue":"2","key":"10.1016\/S1571-0661(05)80248-8_BIBMIL92","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as processes","volume":"vol. 2","author":"Milner","year":"1992","journal-title":"Journal of Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBMIL94","first-page":"26","article-title":"\u03c0-nets: a graphical form of \u03c0-calculus, ESOP'94","volume":"788","author":"Milner","year":"1994"},{"issue":"8","key":"10.1016\/S1571-0661(05)80248-8_BIBMIL96","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s002360050067","article-title":"Calculi for Interaction","volume":"33","author":"Milner","year":"1996","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBMP95","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S1571-0661(04)00024-6","article-title":"Concurrent semantics for the \u03c0-calculus","volume":"vol. 1","author":"Montanari","year":"1995","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBPAR93","first-page":"477","article-title":"Interaction diagrams, A Decade of Concurrency, REX Symposium","volume":"803","author":"Parrow","year":"1993"},{"key":"10.1016\/S1571-0661(05)80248-8_BIBSAN93","unstructured":"Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, PhD thesis, ECS-LFCS-93-266, Department of Computer Science, University of Edinburgh, 1993."},{"key":"10.1016\/S1571-0661(05)80248-8_BIBYOS94","doi-asserted-by":"crossref","unstructured":"Nobuko Yoshida. Graph notation for concurrent combinators, Proceedings Theory and Practice of Parallel Programming - TPPP'94, LNCS 907, pages 393-412, Springer-Verlag, 1994.","DOI":"10.1007\/BFb0026581"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802488?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802488?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:08:07Z","timestamp":1761610087000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":13,"alternative-id":["S1571066105802488"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80248-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Faithful \u03c0-nets.","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)80248-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}