{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:36:41Z","timestamp":1648787801501},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3681,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,7]]},"DOI":"10.1016\/s1571-0661(04)80643-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"257-272","source":"Crossref","is-referenced-by-count":1,"title":["Towards a theory of mathematical operational semantics"],"prefix":"10.1016","volume":"82","author":[{"given":"John","family":"Power","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(95)00011-K","article-title":"On the greatest fixed point of a set functor","volume":"150","author":"Adamek","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB2","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)80358-X","article-title":"GSOS for Probabilistic Transition Systems","volume":"65","author":"Bartels","year":"2002","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(05)80273-7","article-title":"From SOS Specifications to Structured Coalgebras: How to make Bisimulation a Congruence","volume":"19","author":"Corradini","year":"1999","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Fiore M., and D. Turi, Semantics of Name and Value Passing, \u201cProceedings of 16th Symposium on Logic in Computer Science,\u201d IEEE Computer Society Press, 2001, 93\u2013104.","DOI":"10.1109\/LICS.2001.932486"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB5","unstructured":"Hyland M., G.D. Plotkin, and A.J. Power, Combining effects: sum and tensor, (submitted)."},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB6","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bulletin of the European Assocation of Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0004972700006353","article-title":"A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on","volume":"22","author":"Kelly","year":"1980","journal-title":"Bulletin Australian Mathematical Society"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0022-4049(93)90092-8","article-title":"Adjunctions whose counits are coequalizers, and presentations of finitary monads","volume":"89","author":"Kelly","year":"1993","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Kick M., Bialgebraic modelling of timed processes, \u201cProceedings of ICALP 2002,\u201d Lecture Notes in Computer Science 2380, 2002, 525\u2013536.","DOI":"10.1007\/3-540-45465-9_45"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB10","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(05)80350-0","article-title":"Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads","volume":"33","author":"Lenisa","year":"2000","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB11","article-title":"\u201cCommunication and Concurrency,\u201d","author":"Milner","year":"1989","journal-title":"Prentice-Hall International Series in Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB12","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0304-3975(01)00024-X","article-title":"Combining a monad and a comonad","volume":"280","author":"Power","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Turi D., and G.D. Plotkin, Towards a mathematical operational semantics, \u201cProceedings of 12th Symposium on Logic in Computer Science,\u201d IEEE Computer Science Press, 1997, 280\u2013291.","DOI":"10.1109\/LICS.1997.614955"},{"key":"10.1016\/S1571-0661(04)80643-1_NEWBIB14","article-title":"Terminal sequences for accessible endofunctors","volume":"19","author":"Worell","year":"1999","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104806431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:53:39Z","timestamp":1549191219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104806431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S1571066104806431"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80643-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}