English

A Categorical Semantics for Bounded Petri Nets

Category Theory 2022-11-04 v3 Formal Languages and Automata Theory Logic in Computer Science

Abstract

We provide a categorical semantics for bounded Petri nets, both in the collective- and individual-token philosophy. In both cases, we describe the process of bounding a net internally, by just constructing new categories of executions of a net using comonads, and externally, using lax-monoidal-lax functors. Our external semantics is non-local, meaning that tokens are endowed with properties that say something about the global state of the net. We then prove, in both cases, that the internal and external constructions are equivalent, by using machinery built on top of the Grothendieck construction. The individual-token case is harder, as it requires a more explicit reliance on abstract methods.

Cite

@article{arxiv.2101.09100,
  title  = {A Categorical Semantics for Bounded Petri Nets},
  author = {Fabrizio Romano Genovese and Fosco Loregian and Daniele Palombi},
  journal= {arXiv preprint arXiv:2101.09100},
  year   = {2022}
}

Comments

In Proceedings ACT 2021, arXiv:2211.01102

R2 v1 2026-06-23T22:25:23.327Z