Open Petri Nets

Abstract

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 $\mathsf{Open}(\mathsf{Petri})$, 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 $\mathbb{O}\mathbf{pen}(\mathsf{Petri})$. We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of $\mathbb{O}\mathbf{pen}(\mathsf{Petri})$. The first, an operational semantics, gives for each open Petri net a category whose morphisms are the processes that this net can carry out. This is done in a compositional way, so that these categories can be computed on smaller subnets and then glued together. The second, a reachability semantics, simply says which markings of the outputs can be reached from a given marking of the inputs.

30 pages, TikZ figures

References in corpus (8)

• Constructing symmetric monoidal bicategories
• A Compositional Framework for Reaction Networks
• A bicategory of decorated cospans
• Networks of open systems
• Coarse-Graining Open Markov Processes
• An algebra of open continuous time dynamical systems and networks
• Structured Cospans
• Compositionality of the Runge-Kutta Method

Cited by in corpus (29)

• Operads for complex system design specification, analysis and synthesis
• Structured versus Decorated Cospans
• An Algebraic Framework for Structured Epidemic Modeling
• Rule-based epidemic models
• Computational Petri Nets: Adjunctions Considered Harmful
• Compositional Models for Power Systems
• Compositional Scientific Computing with Catlab and SemanticModels
• Petri Nets Based on Lawvere Theories
• Whole-grain Petri nets and processes
• The Mathematical Specification of the Statebox Language
• A Compositional Approach to Parity Games
• The algebra and machine representation of statistical models
• A Formal Model for Quality-Driven Decision Making in Self-Adaptive Systems
• A Categorical Semantics for Hierarchical Petri Nets
• Rewriting Structured Cospans: A Syntax For Open Systems
• An Open Petri Net Implementation of Gene Regulatory Networks
• Compositional modelling of immune response and virus transmission dynamics
• A Categorical Semantics for Bounded Petri Nets
• Applied Category Theory for Genomics -- An Initiative
• On Concept of Creative Petri Nets
• Constructor Theory as Process Theory
• Morphisms of Networks of Hybrid Open Systems
• Compositional Separation of Control Flow and Data Flow
• The Grothendieck Construction in Categorical Network Theory
• Composing Behaviors of Networks
• Colimit-Based Composition of High-Level Computing Devices
• Intraspecific and monotone enzyme catalysis with oscillatory substrate and inhibitor supplies
• Dialectica Petri Nets
• On Concept of Petri Nets Receptors and Effectors