@conference {BBCRS12-draft,
	title = {Final semantics for decorated traces},
	booktitle = {Proceedings of the Twenty-eighth Conference on the Mathematical Foundations of Programming Semantics (MFPS 2012)},
	series = {Electronic Notes in Theoretical Computer Science},
	volume = {286},
	year = {2012},
	month = {June},
	pages = {73{\textendash}86},
	publisher = {Elsevier},
	organization = {Elsevier},
	address = {University of Bath Bath, UK},
	abstract = {<p>In concurrency theory, various semantic equivalences on la- belled transition systems are based on traces enriched or decorated with some additional observations. They are generally referred to as decorated traces, and examples include ready, failure, trace and complete trace equivalence. Using the generalized powerset construction, recently introduced by a subset of the authors (FSTTCS{\textquoteright}10), we give a coalgebraic presentation of decorated trace semantics. This yields a uniform notion of canonical, 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, which is helpful for automation.</p>
},
	attachments = {https://haslab.uminho.pt/sites/default/files/xana/files/decorated.pdf},
	author = {Filippo Bonchi and Marcello Bonsangue and Georgiana Caltais and Jan Rutten and Alexandra Silva}
}