Skip to main content
Conference ProceedingsOPEN ACCESS

Relational presheaves as labelled transition systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2012) 7399 LNCS 40-50
DOI: 10.1007/978-3-642-32784-1_3
9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2012 IFIP International Federation for Information Processing.

Cite

CITATION STYLE

APA

Sobociński, P. (2012). Relational presheaves as labelled transition systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7399 LNCS, pp. 40–50). https://doi.org/10.1007/978-3-642-32784-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free