Enhanced coalgebraic bisimulation

Author(s):
Rot, J.; Bonchi, F.; Bonsangue, M.M. (0000-0003-3746-3618); Pous, D.; Rutten, J.J.M.M.; Silva, A.
Published
2015
Publication type
Article / Letter to editor

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.

Date issued
2015-12-09
Language
English
Is part of
Mathematical Structures in Computer Science (2015), Vol. 27, no. 7, p. 1236-1264
hdl
1887/69169
doi
10.1017/S0960129515000523
URL
https://www.cambridge.org/core/journals/mathematical-structures-in-computer-science/article/enhanced-coalgebraic-bisimulation/C588A590E7DB3A73F1C86487D0F8DE19