Reference. Categories of Nets

We present a unified framework for Petri nets and various variants, such as pre-nets and Kock’s whole-grain Petri nets. Our framework is based on a less well-studied notion that we call Σ-nets, which allow finer control over whether tokens are treated using the collective or individual token philosophy. We describe three forms of execution semantics in which pre-nets generate strict monoidal categories, Σ-nets (including whole-grain Petri nets) generate symmetric strict monoidal categories, and Petri nets generate commutative monoidal categories, all by left adjoint functors. We also construct adjunctions relating these categories of nets to each other, in particular showing that all kinds of net can be embedded in the unifying category of Σ-nets, in a way that commutes coherently with their execution semantics.

Cite

Cite as @baez-2021-categories (helia, typst) · \cite{baez-2021-categories} (LaTeX)
BibTeX
bibtex · 10 lines
@inproceedings{baez-2021-categories,
  author = {John C. Baez and Fabrizio Genovese and Jade Master and Michael Shulman},
  title = {Categories of Nets},
  booktitle = {2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  publisher = {IEEE},
  year = {2021},
  month = {6},
  pages = {1--13},
  doi = {10.1109/lics52264.2021.9470566}
}
hayagriva YAML (typst)
yaml · 16 lines
baez-2021-categories:
  type: article
  title: Categories of Nets
  author:
  - Baez, John C.
  - Genovese, Fabrizio
  - Master, Jade
  - Shulman, Michael
  date: 2021-06
  page-range: 1-13
  serial-number:
    doi: 10.1109/lics52264.2021.9470566
  parent:
    type: proceedings
    title: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    publisher: IEEE
Cited by (2)

Colored Petri Nets are Monoidal Double Functors master-2025-colored

We give a characterization of colored Petri nets as monoidal double functors. Framing colored Petri nets in terms of category theory allows for canonical definitions of various well-known constructions on colored Petri nets. In particular, we show how morphisms of colored Petri nets may be understood as natural transformations. The displayed category construction explains how lax double functors are equivalent to functors with codomain their former domain. We use this result to characterize the unfolding of colored Petri nets in terms of free symmetric monoidal categories.
arXiv

The Univalence Principle ahrens-2021-the

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a non-algebraic and space-based style, as well as models of higher-order theories such as topological spaces. In particular, we formulate a general definition of indiscernibility for objects of any such structure, and a corresponding univalence condition that generalizes Rezk’s completeness condition for Segal spaces and ensures that all equivalences of structures are levelwise equivalences. Our work builds on Makkai’s First-Order Logic with Dependent Sorts, but is expressed in Voevodsky’s Univalent Foundations (UF), extending previous work on the Structure Identity Principle and univalent categories in UF. This enables indistinguishability to be expressed simply as identification, and yields a formal theory that is interpretable in classical homotopy theory, but also in other higher topos models. It follows that Univalent Foundations is a fully equivalence-invariant foundation for higher-categorical mathematics, as intended by Voevodsky.
DOI · arXiv
Cites 38 works (0 here)
External (38)
baez-2021-categories reference entries/refs/baez-2021-categories/baez-2021-categories.hel