Rot, J;
Bonchi, F;
Bonsangue, M;
Pous, D;
Rutten, J;
Silva, A;
(2017)
Enhanced coalgebraic bisimulation.
Mathematical Structures in Computer Science
, 27
(7)
pp. 1236-1264.
10.1017/S0960129515000523.
Preview |
Text
up-to.pdf - Accepted Version Download (508kB) | Preview |
Abstract
We present a systematic study of bisimulation-up-to techniques for coalgebras. This enhances the bisimulation proof method for a large class of state based systems, including labelled transition systems but also stream systems and weighted automata. Our approach allows for compositional reasoning about the soundness of enhancements. Applications include the soundness of bisimulation up to bisimilarity, up to equivalence and up to congruence. All in all, this gives a powerful and modular framework for simplified coinductive proofs of equivalence.
| Type: | Article |
|---|---|
| Title: | Enhanced coalgebraic bisimulation |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1017/S0960129515000523 |
| Publisher version: | http://dx.doi.org/10.1017/S0960129515000523 |
| Language: | English |
| Additional information: | This article has been published in a revised form in Mathematical Structures in Computer Science: http://dx.doi.org/10.1017/S0960129515000523. This version is free to view and download for private research and study only. Not for re-distribution, re-sale or use in derivative works. Copyright © Cambridge University Press 2015. |
| 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/1492922 |
Archive Staff Only
 |
View Item |
