Relational Presheaves as Labelled Transition Systems

Abstract : We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor.
Type de document :
Communication dans un congrès
Dirk Pattinson; Lutz Schröder. 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Mar 2012, Tallinn, Estonia. Springer, Lecture Notes in Computer Science, LNCS-7399, pp.40-50, 2012, Coalgebraic Methods in Computer Science. 〈10.1007/978-3-642-32784-1_3〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01539889
Contributeur : Hal Ifip <>
Soumis le : jeudi 15 juin 2017 - 15:02:50
Dernière modification le : jeudi 15 juin 2017 - 15:25:49
Document(s) archivé(s) le : mercredi 13 décembre 2017 - 12:12:20

Fichier

978-3-642-32784-1_3_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Paweł Sobociński. Relational Presheaves as Labelled Transition Systems. Dirk Pattinson; Lutz Schröder. 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Mar 2012, Tallinn, Estonia. Springer, Lecture Notes in Computer Science, LNCS-7399, pp.40-50, 2012, Coalgebraic Methods in Computer Science. 〈10.1007/978-3-642-32784-1_3〉. 〈hal-01539889〉

Partager

Métriques

Consultations de la notice

138

Téléchargements de fichiers

29