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
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.
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.
Cites 38 works (0 here)
External (38)
- Open Systems: A Double Categorical Perspective (2020)
- Petri nets based on Lawvere theories (2020)
- Elements of Petri nets and processes (2020)
- Structured cospans (2019)
- The Mathematical Specification of the Statebox Language (2019)
- Computational Petri Nets: Adjunctions Considered Harmful (2019)
- Open Petri nets (2018)
- Categorical notions of fibration (2018)
- Executions in (Semi-)Integer Petri Nets are Compact Closed Categories (2018)
- Graphs, hypergraphs, and properads (2016)
- Modular encoding of synchronous and asynchronous interactions using open Petri nets (2015)
- Commutativity (2015)
- On Operads, Bimodules and Analytic Functors (2014)
- Connector algebras for C/E and P/T nets' interactions (2013)
- A direct proof that the category of 3-computads is not cartesian closed (2012)
- Centers and homotopy centers in enriched monoidal categories (2011)
- Petri nets for systems engineering - a guide to modeling, verification, and applications (2010)
- Configuration structures, event structures and Petri nets (2009)
- Polynomial Functors and Trees (2008)
- Note on the Construction of Free Monoids (2008)
- The category of 3-computads is not cartesian closed (2007)
- Toposes Are Adhesive (2006)
- A Congruence for Petri Nets (2005)
- Compositional semantics for open Petri nets based on deterministic processes (2005)
- Adhesive Categories (2004)
- Groupoids and local cartesian closure (2003)
- Pre-nets, Read Arcs and Unfolding: A Functorial Presentation (2002)
- Functorial Models for Petri Nets (2001)
- K(N)-local duality for finite groups and groupoids (2000)
- Functorial semantics for Petri nets under the individual token philosophy (1999)
- An Axiomatization of the Algebra of Petri Net Concatenable Processes (1996)
- On the Category of Petri Net Computations (1995)
- Strong Concatenable Processes: An Approach to the Category of Petri Net Computations (1994)
- The geometry of tensor calculus, I (1991)
- Petri Nets Are Monoids (1990)
- Axiomatizing net computations and processes (1989)
- Petri Net Theory and the Modeling of Systems (1981)
- Graph-Grammars: An Algebraic Approach (1973)