Enhanced Coalgebraic Bisimulation

Jurriaan Rot (1, 2) , Filippo Bonchi (3, 4) , Marcello Bonsangue (1, 2) , Damien Pous (3, 4) , Jan Rutten (5, 1) , Alexandra Silva (1, 5)

1 CWI - Centrum voor Wiskunde en Informatica
2 LIACS - Leiden Institute of Advanced Computer Science [Leiden]
3 LIP - Laboratoire de l'Informatique du Parallélisme
4 PLUME - Preuves et Langages
5 Radboud University [Nijmegen]

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.

Domaines: Logique en informatique [cs.LO]

Jurriaan Rot, Filippo Bonchi, Marcello Bonsangue, Damien Pous, Jan Rutten, et al.. Enhanced Coalgebraic Bisimulation. Mathematical Structures in Computer Science, 2015, ⟨10.1017/S0960129515000523⟩. ⟨hal-01288960⟩