A coalgebraic view on decorated traces. (3rd December 2014)

• Record Type: Journal Article
• Authors: BONCHI, F.; BONSANGUE, M.; CALTAIS, G.; RUTTEN, J.; SILVA, A.
• Is Part Of: Mathematical structures in computer science. Volume 26:Number 7(2016)
• Page Start: 1234
• Page End: 1268
• Publication Date: 2014-12-03
• Subjects: Computer science -- Mathematics -- Periodicals; 004.015105
• DOI: 10.1017/S0960129514000449
• Languages: English
• ISSNs: 0960-1295

Abstract

Abstract : In the concurrency theory, various semantic equivalences on transition systems are based on traces decorated with some additional observations, generally referred to as decorated traces . Using the generalized powerset construction, recently introduced by a subset of the authors (Silva et al. 2010 FSTTCS. LIPIcs 8 272–283), 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).