{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:46:03Z","timestamp":1726425963937},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"7","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2016,10]]},"abstract":"<jats:p>In the concurrency theory, various semantic equivalences on transition systems are based on traces <jats:italic>decorated<\/jats:italic> with some additional observations, generally referred to as <jats:italic>decorated traces<\/jats:italic>. Using the generalized powerset construction, recently introduced by a subset of the authors (Silva <jats:italic>et al.<\/jats:italic>2010 FSTTCS. <jats:italic>LIPIcs<\/jats:italic><jats:bold>8<\/jats:bold> 272\u2013283), we give a coalgebraic presentation of decorated trace semantics. The latter include ready, failure, (complete) trace, possible futures, ready trace and failure trace semantics for labelled transition systems, and ready, (maximal) failure and (maximal) trace semantics for generative probabilistic systems. This yields a uniform notion of minimal representatives for the various decorated trace equivalences, in terms of final Moore automata. As a consequence, proofs of decorated trace equivalence can be given by coinduction, using different types of (Moore-) bisimulation (up-to context).<\/jats:p>","DOI":"10.1017\/s0960129514000449","type":"journal-article","created":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T13:39:29Z","timestamp":1417613969000},"page":"1234-1268","source":"Crossref","is-referenced-by-count":3,"title":["A coalgebraic view on decorated traces"],"prefix":"10.1017","volume":"26","author":[{"given":"F.","family":"BONCHI","sequence":"first","affiliation":[]},{"given":"M.","family":"BONSANGUE","sequence":"additional","affiliation":[]},{"given":"G.","family":"CALTAIS","sequence":"additional","affiliation":[]},{"given":"J.","family":"RUTTEN","sequence":"additional","affiliation":[]},{"given":"A.","family":"SILVA","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"S0960129514000449_ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511792588"},{"key":"S0960129514000449_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80265-8"},{"key":"S0960129514000449_ref3","unstructured":"Bartels F. (2004) On Generalised Coinduction and Probabilistic Specification Formats, Ph.D. thesis, CWI, Amsterdam."},{"key":"S0960129514000449_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.030"},{"key":"S0960129514000449_ref26","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044482830-9\/50019-9"},{"key":"S0960129514000449_ref9","first-page":"79","article-title":"Generalized coiteration schemata","volume":"82","author":"Cancila","year":"2003","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"S0960129514000449_ref24","first-page":"272","article-title":"Generalizing the powerset construction, coalgebraically","volume":"8","author":"Silva","year":"2010","journal-title":"Leibniz International Proceedings in Informatics"},{"key":"S0960129514000449_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)80350-0"},{"key":"S0960129514000449_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"S0960129514000449_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03741-2_10"},{"volume-title":"Category theory","year":"2010","author":"Awodey","key":"S0960129514000449_ref2"},{"key":"S0960129514000449_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039071"},{"key":"S0960129514000449_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03542-0_1"},{"key":"S0960129514000449_ref25","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(1:9)2013"},{"volume-title":"Communication and Concurrency","year":"1989","author":"Milner","key":"S0960129514000449_ref17"},{"key":"S0960129514000449_ref12","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"S0960129514000449_ref1","first-page":"197","article-title":"Structural operational semantics","author":"Aceto","year":"1999","journal-title":"Handbook of Process Algebra"},{"key":"S0960129514000449_ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03429-9_17"},{"key":"S0960129514000449_ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2455.2460"},{"key":"S0960129514000449_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211314"},{"key":"S0960129514000449_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.07.019"},{"key":"S0960129514000449_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017309"},{"key":"S0960129514000449_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.08.002"},{"key":"S0960129514000449_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35843-2_32"},{"key":"S0960129514000449_ref7","first-page":"457","volume-title":"Principles of Programming Languages","author":"Bonchi","year":"2013"},{"key":"S0960129514000449_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2012.08.006"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129514000449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T22:01:19Z","timestamp":1555624879000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129514000449\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":26,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["S0960129514000449"],"URL":"https:\/\/doi.org\/10.1017\/s0960129514000449","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"type":"print","value":"0960-1295"},{"type":"electronic","value":"1469-8072"}],"subject":[],"published":{"date-parts":[[2014,12,3]]}}}