Weak Bisimulations for Coalgebras over Ordered Functors

Abstract : The aim of this paper is to introduce a coalgebraic setting in which it is possible to generalize and compare the two known approaches to defining weak bisimulation for labelled transition systems. We introduce two definitions of weak bisimulation for coalgebras over ordered functors, show their properties and give sufficient conditions for them to coincide. We formulate a weak coinduction principle.
Type de document :
Communication dans un congrès
Jos C. M. Baeten; Tom Ball; Frank S. Boer. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7604, pp.87-103, 2012, Theoretical Computer Science. 〈10.1007/978-3-642-33475-7_7〉
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01556223
Contributeur : Hal Ifip <>
Soumis le : mardi 4 juillet 2017 - 17:45:44
Dernière modification le : mardi 4 juillet 2017 - 17:47:02
Document(s) archivé(s) le : vendredi 15 décembre 2017 - 01:42:51

Fichier

978-3-642-33475-7_7_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Tomasz Brengos. Weak Bisimulations for Coalgebras over Ordered Functors. Jos C. M. Baeten; Tom Ball; Frank S. Boer. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. Springer, Lecture Notes in Computer Science, LNCS-7604, pp.87-103, 2012, Theoretical Computer Science. 〈10.1007/978-3-642-33475-7_7〉. 〈hal-01556223〉

Partager

Métriques

Consultations de la notice

33

Téléchargements de fichiers

15