Relational Presheaves as Labelled Transition Systems - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Relational Presheaves as Labelled Transition Systems

(1)
1

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.
Fichier principal
Vignette du fichier
978-3-642-32784-1_3_Chapter.pdf (311.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01539889 , version 1 (15-06-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Paweł Sobociński. Relational Presheaves as Labelled Transition Systems. 11th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Mar 2012, Tallinn, Estonia. pp.40-50, ⟨10.1007/978-3-642-32784-1_3⟩. ⟨hal-01539889⟩
87 View
162 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More