Bonchi, F;
Bonsangue, M;
Caltais, G;
Rutten, J;
Silva, A;
(2016)
A coalgebraic view on decorated traces.
Mathematical Structures in Computer Science
, 26
(7)
pp. 1234-1268.
10.1017/S0960129514000449.
Preview |
Text
silva_new-dec-traces-mscs.pdf Download (551kB) | Preview |
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).
Type: | Article |
---|---|
Title: | A coalgebraic view on decorated traces |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1017/S0960129514000449 |
Publisher version: | http://doi.org/10.1017/S0960129514000449 |
Language: | English |
Additional information: | © Cambridge University Press 2014. |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1522644 |
Archive Staff Only
View Item |