Nets, relations and linking diagrams
Logic in Computer Science
2013-06-04 v2 Category Theory
Logic
Abstract
In recent work, the author and others have studied compositional algebras of Petri nets. Here we consider mathematical aspects of the pure linking algebras that underly them. We characterise composition of nets without places as the composition of spans over appropriate categories of relations, and study the underlying algebraic structures.
Keywords
Cite
@article{arxiv.1303.3371,
title = {Nets, relations and linking diagrams},
author = {Pawel Sobocinski},
journal= {arXiv preprint arXiv:1303.3371},
year = {2013}
}
Comments
15 pages, Proceedings of 5th Conference on Algebra and Coalgebra in Computer Science (CALCO), Warsaw, Poland, 3-6 September 2013