Petri nets based on Lawvere theories

From MaRDI portal
Publication:3386752

DOI10.1017/S0960129520000262zbMATH Open1492.68097arXiv1904.09091MaRDI QIDQ3386752FDOQ3386752

Jade Master

Publication date: 7 January 2021

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Abstract: We give a definition of mathsfQ-net, a generalization of Petri nets based on a Lawvere theory mathsfQ, for which many existing variants of Petri nets are a special case. This definition is functorial with respect to change in Lawvere theory, and we exploit this to explore the relationships between different kinds of mathsfQ-nets. To justify our definition of mathsfQ-net, we construct a family of adjunctions for each Lawvere theory explicating the way in which mathsfQ-nets present free models of mathsfQ in mathsfCat. This gives a functorial description of the operational semantics for an arbitrary category of mathsfQ-nets. We show how this can be used to construct the semantics for Petri nets, pre-nets, integer nets, and elementary net systems.


Full work available at URL: https://arxiv.org/abs/1904.09091




Recommendations




Cites Work


Cited In (7)





This page was built for publication: Petri nets based on Lawvere theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386752)