{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:17:11Z","timestamp":1778037431903,"version":"3.51.4"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5323,"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":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80319-6","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"259-274","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"special_numbering":"C","title":["A Coalgebraic Foundation for Linear Time Semantics"],"prefix":"10.1016","volume":"29","author":[{"given":"John","family":"Power","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Turi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80319-6_BIB1","series-title":"Number 14 in Lecture Notes. CSLI","article-title":"Non-well-founded sets","author":"Aczel","year":"1988"},{"issue":"1","key":"10.1016\/S1571-0661(05)80319-6_BIB2","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(05)80319-6_BIB3","doi-asserted-by":"crossref","unstructured":"P. Aczel and N.P. Mendler. A final coalgebra theorem. In D. H. Pitt, D. E. Rydeheard, P. Dybjer, A. M. Pitts, and A. Poign\u00e9, editors, Proceedings of the Conference on Category Theory and Computer Science, volume 389 of LNCS, pages 357\u2013365, Berlin, September 1989. Springer.","DOI":"10.1007\/BFb0018361"},{"issue":"2","key":"10.1016\/S1571-0661(05)80319-6_BIB4","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","article-title":"Terminal coalgebras in well-founded set theory","volume":"114","author":"Barr","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB5","doi-asserted-by":"crossref","unstructured":"J. Beck. Distributive laws. In B. Eckmann, editor, Seminar on Triples and Categorical Homology Theory, volume 80 of Lecture Notes in Mathematics, pages 119\u2013140. Springer-Verlag, 1969.","DOI":"10.1007\/BFb0083084"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB6","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced. Journal of the ACM, 42(1):232\u2013268, jan 1995. A preliminary report appeared in Proc. 3rd LICS, pages 229\u2013239, 1988.","DOI":"10.1145\/200836.200876"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB7","first-page":"263","article-title":"Open maps (at) work. Technical Report RS-95-23, BRICS","author":"Cheng","year":"1995","journal-title":"Appears with the title Observing Behaviour Categorically in LNCS 1026"},{"issue":"1-2","key":"10.1016\/S1571-0661(05)80319-6_BIB8","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(84)90114-2","article-title":"Linear time and branching time semantics for recursion with merge","volume":"34","author":"de Bakker, J.A. Bergstra","year":"1984","journal-title":"Theoretical Computer-Science"},{"issue":"3","key":"10.1016\/S1571-0661(05)80319-6_BIB9","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1007\/BF01941131","article-title":"Metric semantics for concurrency","volume":"28","author":"de Bakker","year":"1988","journal-title":"BIT"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB10","series-title":"Distinguished Dissertations Series","article-title":"Axiomatic Domain Theory in Categories of Partial Maps","author":"Fiore","year":"1996"},{"issue":"1","key":"10.1016\/S1571-0661(05)80319-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.0030","article-title":"Ntyft\/ntyxt rules reduce to ntree rules","volume":"126","author":"Fokkink","year":"1996","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB12","doi-asserted-by":"crossref","unstructured":"P.J. Freyd. Algebraically complete categories. In A. Carboni et al., editors, Proc. 1990 Como Category Theory Conference, pages 95\u2013104, Berlin, 1991. Springer-Verlag. Lecture Notes in Mathematics Vol. 1488.","DOI":"10.1007\/BFb0084215"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB13","series-title":"Current Trends in Programming Methodology. volume IV","first-page":"80","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"issue":"2","key":"10.1016\/S1571-0661(05)80319-6_BIB14","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"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB15","series-title":"Proc. 8th MFCS. volume 74 of LNCS","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","author":"Hennessy","year":"1979"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB16","series-title":"CMCS'98 First Workshop on Coalgebraic Methods in Computer Science, volume 11. ENTCS","year":"1998"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB17","volume":"volume 19","year":"1999"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB18","article-title":"An axiomatics for categories of transition systems as coalgebras","author":"Johnstone","year":"1998","journal-title":"LICS: IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB19","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/LICS.1993.287566","article-title":"Bisimulation and open maps","author":"Joyal","year":"1993","journal-title":"Proc. Eighth IEEE Symp. on Logic In Computer Science"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB21","series-title":"Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf., volume 802 of LNCS","first-page":"304","article-title":"Lifting theorems for Kleisli categories","author":"Mulry","year":"1994"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB22","article-title":"Post-graduate lecture notes in advanced domain theory (incorporating the \u201cPisa Notes\u201d)","author":"Plotkin","year":"1981","journal-title":"Dept. of Computer Science, Univ. of Edinburgh"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB23","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981","journal-title":"Technical Report DAIMI FN-19, Computer Science Department, Aarhus University"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB24","series-title":"Proc. of the REX workshop A Decade of Concurrency - Reflections and Perspectives, volume 803 of LNCS","first-page":"530","article-title":"Initial algebra and final coalgebra semantics for concurrency","author":"Rutten","year":"1994"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB25","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S1571-0661(05)80319-6_BIB26","article-title":"On final semantics for applicative and non-deterministic languages","author":"Turi","year":"1993","journal-title":"Fifth Biennal Meeting on Category Theory and Computer Science, Amsterdam"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB27","series-title":"Proc. 12th LICS Conf","first-page":"280","article-title":"Towards a mathematical operational semantics","author":"Turi","year":"1997"},{"issue":"5","key":"10.1016\/S1571-0661(05)80319-6_BIB28","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0960129598002588","article-title":"On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces","volume":"8","author":"Turi","year":"1998","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(05)80319-6_BIB29","series-title":"Proc. 7th CTCS Conf, volume 1290 of LNCS","first-page":"127","article-title":"Categorical modelling of structural operational rules: case studies","author":"Turi","year":"1997"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803196?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:27Z","timestamp":1761610047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":29,"alternative-id":["S1571066105803196"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80319-6","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Coalgebraic Foundation for Linear Time Semantics","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)80319-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}