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.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
