{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:39Z","timestamp":1761610359676,"version":"build-2065373602"},"reference-count":24,"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)80471-2","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"141-160","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Process Creation and Full Sequential Composition in a Name-Passing Calculus"],"prefix":"10.1016","volume":"7","author":[{"given":"Thomas","family":"Gehrke","sequence":"first","affiliation":[]},{"given":"Arend","family":"Rensink","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80471-2_BIB1","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and C. Verhoef. A congruence theorem for structured operational semantics with predicates. In E. Best, editor, Proceedings of CONCUR '93, volume 715 of Lecture Notes in Computer Science, pages 477-492. Springer, 1993.","DOI":"10.1007\/3-540-57208-2_33"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB2","series-title":"volume 18 of Cambridge Tracts in Theoretical Computer Science.","article-title":"Process Algebra","author":"Baeten","year":"1990"},{"issue":"4","key":"10.1016\/S1571-0661(05)80471-2_BIB3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01178776","article-title":"An Algebra for Process Creation","volume":"29","author":"Baeten","year":"1992","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","article-title":"Algebra for Communicating Processes with Abstraction","volume":"37","author":"Bergstra","year":"1985","journal-title":"Journal of Theoretical Computer Science"},{"issue":"1","key":"10.1016\/S1571-0661(05)80471-2_BIB5","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation Can't Be Traced","volume":"42","author":"Bloom","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0304-3975(96)00063-1","article-title":"A \u03c0-calculus with explicit substitutions","volume":"168","author":"Ferrari","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB7","doi-asserted-by":"crossref","unstructured":"W. Ferreira and M. Hennessy. Towards a Semantic Theory of CML. Technical Report 2\/95, University of Sussex, February 1995.","DOI":"10.1007\/3-540-60246-1_151"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB8","unstructured":"William Ferreira, Matthew Hennessy, and Alan Jeffrey. A Theory of Weak Bisimulation for Core CML. Technical Report 05\/95, University of Sussex, September 1995."},{"key":"10.1016\/S1571-0661(05)80471-2_BIB9","doi-asserted-by":"crossref","unstructured":"Thomas Gehrke and Michaela Huhn. ProFun - a Language for Executable Specifications. In H. Kuchen and S.D. Swierstra, editors, Proceedings of PLILP '96, volume 1140 of Lecture Notes in Computer Science, pages 304-318. Springer, 1996.","DOI":"10.1007\/3-540-61756-6_93"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB10","article-title":"Process Creation and Full Sequential Composition in a Name-Passing Calculus","author":"Gehrke","year":"1997","journal-title":"Hildesheimer Informatik-Bericht HIB 7\/97, Institut f\u00fcr Informatik, Universit\u00e4t Hildesheim"},{"issue":"2","key":"10.1016\/S1571-0661(05)80471-2_BIB11","doi-asserted-by":"crossref","DOI":"10.1007\/BF01491213","article-title":"Facile: A symmetric integration of concurrent and functional programming","volume":"18","author":"Giacalone","year":"1989","journal-title":"International Journal of Parallel Programming"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB12","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/inco.1996.0026","article-title":"Comparing Syntactic and Semantic Action Refinement","volume":"125","author":"Goltz","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB13","doi-asserted-by":"crossref","unstructured":"Ursula Goltz and Rob J. van Glabbeek. Equivalence Notions for Concurrent Systems and Refinement of Actions. In Proceedings of MFCS '89, Lecture Notes in Computer Science, pages 237-248. Springer, 1989.","DOI":"10.1007\/3-540-51486-4_71"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB14","doi-asserted-by":"crossref","unstructured":"Klaus Havelund. The Fork Calculus., PhD thesis, DIKU, University of Kopenhagen, 1994.","DOI":"10.1007\/3-540-56939-1_101"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB15","first-page":"346","article-title":"The Fork-Calculus","volume":"1","author":"Havelund","year":"1994","journal-title":"Nordic Journal of Computing"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)80471-2_BIB16"},{"issue":"2","key":"10.1016\/S1571-0661(05)80471-2_BIB17","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Information and Computation"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80471-2_BIB18"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB19","unstructured":"Robin Milner. Functions as Processes. Technical Report 1154, INRIA, February 1990."},{"key":"10.1016\/S1571-0661(05)80471-2_BIB20","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)80471-2_BIB21","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":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB22","series-title":"Programming, Concurrency, Simulation and Automated Reasoning, volume 693 of Lecture Notes in Computer Science","first-page":"165","article-title":"Concurrent ML: Design, application and semantics","author":"Reppy","year":"1992"},{"key":"10.1016\/S1571-0661(05)80471-2_BIB23","unstructured":"Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms., PhD thesis, Department of Computer Science, University of Edinburgh, 1992. No. CST-99\u201393; also available as ECS-LFCS-93\u2013266."},{"key":"10.1016\/S1571-0661(05)80471-2_BIB24","doi-asserted-by":"crossref","unstructured":"Bent Thomsen, Lone Leth, and Alessandro Giacalone. Some Issues in the Semantics of Facile Distributed Programming. In Proceedings of REX Workshop \u201cSemantics: Foundations and Applications\u201d, volume 666 of Lecture Notes in Computer Science., Springer, 1992.","DOI":"10.1007\/3-540-56596-5_47"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804712?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804712?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:06:43Z","timestamp":1761610003000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":24,"alternative-id":["S1571066105804712"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80471-2","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":"Process Creation and Full Sequential Composition in a Name-Passing Calculus","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)80471-2","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"}]}}