Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
430000 | Journal of Computer and System Sciences | 2015 | 10 Pages |
Abstract
We show that considering labelled transition systems as relational presheaves captures several recently studied examples in a general setting. This approach takes into account possible algebraic structure on labels. We show that left (2-)adjoints to change-of-base functors between categories of relational presheaves with relational morphisms always exist and, as an application, that weak closure (in the sense of Milner) of a labelled transition system can be understood as a left adjoint to a change-of-base functor.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paweł Sobociński,