{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:16:53Z","timestamp":1761610613369,"version":"build-2065373602"},"reference-count":28,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":4958,"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":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80342-1","type":"journal-article","created":{"date-parts":[[2005,4,27]],"date-time":"2005-04-27T07:41:43Z","timestamp":1114587703000},"page":"13-41","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Compositional Constructor Interpretation over Coalgebraic Models for the \u03c0\u2014Calculus"],"prefix":"10.1016","volume":"33","author":[{"given":"Michael","family":"Baldamus","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80342-1_BIB1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/inco.1991.9999","article-title":"A Domain Equation for Bisimulation","volume":"92","author":"Abramsky","year":"1991","journal-title":"Information and Computation"},{"year":"1988","series-title":"Non-well-founded Sets","author":"Aczel","key":"10.1016\/S1571-0661(05)80342-1_BIB2"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB3","first-page":"1","article-title":"Final Universes of Processes","volume":"802","author":"Aczel","year":"1994"},{"year":"1990","series-title":"Process Algebra","author":"Baeten","key":"10.1016\/S1571-0661(05)80342-1_BIB4"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB5","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the Denotational Semantics of Concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Information and Control"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB6","article-title":"A Non-well-founded Sets Semantics for Observation Congruence over Full CCS","author":"Baldamus","year":"1994","journal-title":"Technical Report 1994\/31, computer science department, Berlin University of Technology"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB7","article-title":"Adding Enrichments to Refined Interleavings: A New Model for the \u03c0-Calculus","author":"Baldamus","year":"1999","journal-title":"Technical Report MATH-AL-01-1999, Institute for Algebra, Dresden University of Technology"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB8","first-page":"106","article-title":"Presheaf Models for the \u03c0-Calculus. Category Theory in Computer Science","volume":"1290","author":"Cattani","year":"1997"},{"year":"1985","series-title":"Testing Equivalences and Fully Abstract Models for Communicating Processes","author":"De Nicola","key":"10.1016\/S1571-0661(05)80342-1_BIB9"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB10","first-page":"57","article-title":"The Weak Late \u03c0-Calculus Semantics as Observation Equivalence. Concurrency Theory","volume":"962","author":"Ferrari","year":"1995"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB11","series-title":"Logic in Computer Science. LICS symposium","first-page":"43","article-title":"A Fully Abstract Model for the \u03c0-Calculus","author":"Fiore","year":"1996"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(95)00087-9","article-title":"A General Construction of Hyperuniverses","volume":"156","author":"Forti","year":"1996","journal-title":"Theoretical Computer Science"},{"year":"1988","series-title":"Algebraic Theory of Processes","author":"Hennessy","key":"10.1016\/S1571-0661(05)80342-1_BIB13"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB14","article-title":"A Fully Abstract Denotational Semantics for the \u03c0- Calculus","author":"Hennessy","year":"1996","journal-title":"Technical Report 96:04, School of Cognitive and Computing Sciences, University of Sussex"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)80342-1_BIB15"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB16","first-page":"225","article-title":"Final Semantics for the \u03c0-Calculus","author":"Honsell","year":"1998"},{"year":"1994","series-title":"Semantic Models for Communicating Processes with Value-Passing","author":"Ing\u00f3lfsd\u00f3ttir","key":"10.1016\/S1571-0661(05)80342-1_BIB17"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB18","unstructured":"M. Lenisa. Themes in Final Semantics. PhD thesis, Universit\u00b4 di Pisa-Udine, 1998."},{"year":"1989","series-title":"Communication and Concurency","author":"Milner","key":"10.1016\/S1571-0661(05)80342-1_BIB19"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","article-title":"Functions as Processes","volume":"2","author":"Milner","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB21","first-page":"45","article-title":"Modal Logics for Mobile Processes. Concurrent\/Theory","volume":"527","author":"Milner","year":"1991"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB22","first-page":"1","article-title":"A Calculus of Mobile Processes, Parts I\/II","volume":"100","author":"Milner","year":"1989","journal-title":"Information and Computation 1992. Journal version of a technical report from"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB23","first-page":"685","article-title":"Barbed Bisimulation, Automata, Languages and Programming","volume":"623","author":"Milner","year":"1992"},{"year":"1996","series-title":"The \u03c0-Calculus with Explicit Substitutions","author":"Quaglia","key":"10.1016\/S1571-0661(05)80342-1_BIB24"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1017\/S096012950000147X","article-title":"Processes as Terms: Non-well-founded Models for Bisimulation","volume":"2","author":"Rutten","year":"1992","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB26","first-page":"530","article-title":"Initial Algebra and Final Coalgebra Semantics for Concurrency. A Decade of Concurrency-Reflections and Perspectives","volume":"803","author":"Rutten","year":"1994"},{"key":"10.1016\/S1571-0661(05)80342-1_BIB27","unstructured":"D. Sangiorgi. Expressing Mobility in Process Algebras: First-order and Higher-order Paradigms. PhD Thesis CST-99-93, Department of Computer Science, The University of Edinburgh, 1993."},{"key":"10.1016\/S1571-0661(05)80342-1_BIB28","series-title":"Logic in Computer Science. LICS symposium","first-page":"36","article-title":"A Fully Abstract Domain Model for the \u03c0\u2014Calculus","author":"Stark","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803421?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:19Z","timestamp":1761610099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":28,"alternative-id":["S1571066105803421"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80342-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Compositional Constructor Interpretation over Coalgebraic Models for the \u03c0\u2014Calculus","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)80342-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}