Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01539889
Contributor : Hal Ifip <>
Submitted on : Thursday, June 15, 2017 - 3:02:50 PM
Last modification on : Saturday, June 8, 2019 - 2:20:03 PM
Long-term archiving on: : Wednesday, December 13, 2017 - 12:12:20 PM

File

978-3-642-32784-1_3_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

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⟩

Share

Metrics

Record views

207

Files downloads

421