Transitivity and Difunctionality of Bisimulations - Coalgebraic Methods in Computer Science
Conference Papers Year : 2016

Transitivity and Difunctionality of Bisimulations

Abstract

Bisimilarity and observational equivalence are notions that agree in many classical models of coalgebras, such as e.g. Kripke structures. In the general category $Set_{F}$-coalgebras these notions may, however, diverge. In many cases, observational equivalence, being transitive, turns out to be more useful.In this paper, we shall investigate the role of transitivity for the largest bisimulation of a coalgebra. Passing to relations between two coalgebras, we choose difunctionality as generalization of transitivity. Since in $Set_{F}$ bisimulations are known to coincide with $\bar{F}-$ simulations, we are led to study the notion of $L-$ similarity, where L is a relation lifting.
Fichier principal
Vignette du fichier
418352_1_En_4_Chapter.pdf (382.83 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01446032 , version 1 (25-01-2017)

Licence

Identifiers

Cite

Mehdi Zarrad, H. Peter Gumm. Transitivity and Difunctionality of Bisimulations. 13th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2016, Eindhoven, Netherlands. pp.33-52, ⟨10.1007/978-3-319-40370-0_4⟩. ⟨hal-01446032⟩
85 View
151 Download

Altmetric

Share

More