Nets, relations and linking diagrams
Linking diagrams are widespread in Theoretical Computer Science and related fields. 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 some algebraic properties of the linking diagrams.