{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T08:36:02Z","timestamp":1726475762816},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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":331,"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":[[2012,9]]},"DOI":"10.1016\/j.entcs.2012.08.006","type":"journal-article","created":{"date-parts":[[2012,9,28]],"date-time":"2012-09-28T00:13:17Z","timestamp":1348791197000},"page":"73-86","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Final Semantics for Decorated Traces"],"prefix":"10.1016","volume":"286","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Georgiana","family":"Caltais","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[]},{"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"article-title":"Category theory","year":"2010","author":"Awodey","key":"10.1016\/j.entcs.2012.08.006_br0010"},{"key":"10.1016\/j.entcs.2012.08.006_br0020","unstructured":"Bonchi, F. and D. Pous, Checking NFA equivalence with bisimulations up to congruence, Technical report (2012), 13p. URL http:\/\/hal.archives-ouvertes.fr\/hal-00639716."},{"key":"10.1016\/j.entcs.2012.08.006_br0030","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.tcs.2006.05.030","article-title":"Processes as formal power series: A coinductive approach to denotational semantics","volume":"360","author":"Boreale","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.entcs.2012.08.006_br0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01211314","article-title":"Testing equivalence as a bisimulation equivalence","volume":"5","author":"Cleaveland","year":"1993","journal-title":"Formal Asp. Comput."},{"key":"10.1016\/j.entcs.2012.08.006_br0050","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-3(4:11)2007","article-title":"Generic trace semantics via coinduction","volume":"3","author":"Hasuo","year":"2007","journal-title":"Logical Methods in Computer Science"},{"article-title":"Communication and concurrency","year":"1989","author":"Milner","key":"10.1016\/j.entcs.2012.08.006_br0060"},{"key":"10.1016\/j.entcs.2012.08.006_br0070","series-title":"WADT","first-page":"251","article-title":"A coalgebraic characterization of behaviours in the linear time \u2013 branching time spectrum","volume":"vol. 5486","author":"Monteiro","year":"2008"},{"key":"10.1016\/j.entcs.2012.08.006_br0080","series-title":"Theoretical Computer Science","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/j.entcs.2012.08.006_br0090","series-title":"CALCO\u02bc09","article-title":"Circular Coinduction \u2013 A Proof Theoretical Foundation","author":"Ro\u015fu","year":"2009"},{"key":"10.1016\/j.entcs.2012.08.006_br0100","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.entcs.2012.08.006_br0110","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511792588","article-title":"Advanced Topics in Bisimulation and Coinduction","author":"Sangiorgi","year":"2011"},{"key":"10.1016\/j.entcs.2012.08.006_br0120","unstructured":"Silva, A., F. Bonchi, M. Bonsangue and J. Rutten, Generalizing determinization from automata to coalgebras, submitted."},{"key":"10.1016\/j.entcs.2012.08.006_br0130","series-title":"FSTTCS 2010","first-page":"272","article-title":"Generalizing the powerset construction, coalgebraically","volume":"vol. 8","author":"Silva","year":"2010"},{"key":"10.1016\/j.entcs.2012.08.006_br0140","series-title":"Handbook of Process Algebra","first-page":"3","article-title":"The linear time \u2013 branching time spectrum I. The semantics of concrete, sequential processes","author":"van Glabbeek","year":"2001"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000369?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066112000369?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T13:21:41Z","timestamp":1542720101000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066112000369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":14,"alternative-id":["S1571066112000369"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2012.08.006","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}