Open Petri Nets

by   John C. Baez, et al.

The reachability semantics for Petri nets can be studied using open Petri nets. For us an 'open' Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category, which becomes symmetric monoidal under disjoint union. However, since the composite of open Petri nets is defined only up to isomorphism, it is better to treat them as morphisms of a symmetric monoidal double category Open(Petri). Various choices of semantics for open Petri nets can be described using symmetric monoidal double functors out of Open(Petri). Here we describe the reachability semantics, which assigns to each open Petri net the relation saying which markings of the outputs can be obtained from a given marking of the inputs via a sequence of transitions. We show this semantics gives a symmetric monoidal lax double functor from Open(Petri) to the double category of relations. A key step in the proof is to treat Petri nets as presentations of symmetric monoidal categories; for this we use the work of Meseguer, Montanari, Sassone and others.


page 1

page 2

page 3

page 4


A Categorical Semantics for Hierarchical Petri Nets

We show how a particular flavor of hierarchical nets, where the firing o...

A Categorical Semantics for Guarded Petri Nets

We build on the correspondence between Petri nets and frees ymmetric str...

Network Models from Petri Nets with Catalysts

Petri networks and network models are two frameworks for the composition...

Computational Petri Nets: Adjunctions Considered Harmful

We review some of the endeavors in trying to connect Petri nets with fre...

The Essence of Petri Net Gluings

Many categorical frameworks have been proposed to formalize the idea of ...

Dealing with Uncertainty on the Initial State of a Petri Net

This paper proposes a method to find the actual state of a complex dynam...

Double pushout rewriting of C-sets

We generalize a pushout complement algorithm from graph rewriting to fin...

Please sign up or login with your details

Forgot password? Click here to reset