Bisimilarity and observational equivalence are notions that agree in many classical models of coalgebras, such as e.g. Kripke structures. In the general category SetF of 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 SetF bisimulations are known to coincide with F−simulations, we are led to study the notion of L−similarity, where L is a relation lifting.
CITATION STYLE
Zarrad, M., & Gumm, H. P. (2016). Transitivity and difunctionality of bisimulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9608, pp. 33–52). Springer Verlag. https://doi.org/10.1007/978-3-319-40370-0_4
Mendeley helps you to discover research relevant for your work.