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. |
Year | DOI | Venue |
---|---|---|
2015 | 10.1016/j.jcss.2014.12.007 | J. Comput. Syst. Sci. |
Keywords | DocType | Volume |
category theory,simulation | Journal | 81 |
Issue | ISSN | Citations |
5 | 0022-0000 | 1 |
PageRank | References | Authors |
0.36 | 27 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Paweł Sobociński | 1 | 609 | 45.57 |