Open Petri nets

DOI10.1017/S0960129520000043MaRDI QIDQ5139283zbMATH OpenFDO

Authors John Baez, Jade Master

Publication date 8 December 2020

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://arxiv.org/abs/1808.05415

zbMATH Keywords

double categoryopen systemoperational semanticsPetri netreachability

Mathematics Subject Classification ID

Categorical semantics of formal languages (18C50) Monoidal categories, symmetric monoidal categories (18M05) 2-categories, bicategories, double categories (18N10) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

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 $mathsfOpen(mathsfPetri)$, 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 $mathbbOmathbfpen(mathsfPetri)$. We describe two forms of semantics for open Petri nets using symmetric monoidal double functors out of $mathbbOmathbfpen(mathsfPetri)$. 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.

Recommendations

• A congruence for Petri nets
• Compositional semantics for open Petri nets based on deterministic processes
• Petri nets are monoids
• scientific article; zbMATH DE number 1863181
• Open Petri Nets: Non-deterministic Processes and Compositionality

Cites work

• A bicategory of decorated cospans
• A compositional framework for reaction networks
• A congruence for Petri nets
• A connector algebra for P/T nets interactions
• An Algorithm for the General Petri Net Reachability Problem
• An axiomatization of the algebra of Petri net concatenable processes
• An axiomatization of the category of Petri net computations
• Asynchronous traces and open Petri nets
• Bicategories of Markov Processes
• Categories of continuous functors. I
• Coarse-graining open Markov processes
• Coloured Petri Nets
• Compact closed bicategories
• Compositional reachability in Petri nets
• Compositional semantics for open Petri nets based on deterministic processes
• Configuration structures, event structures and Petri nets
• Connector algebras for C/E and P/T nets' interactions
• Demystifying Reachability in Vector Addition Systems
• Functorial models for Petri nets
• scientific article; zbMATH DE number 1646978 (Why is no real title available?)
• scientific article; zbMATH DE number 4191145 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 193170 (Why is no real title available?)
• scientific article; zbMATH DE number 1216133 (Why is no real title available?)
• scientific article; zbMATH DE number 2139647 (Why is no real title available?)
• scientific article; zbMATH DE number 1389226 (Why is no real title available?)
• scientific article; zbMATH DE number 3305134 (Why is no real title available?)
• scientific article; zbMATH DE number 3329974 (Why is no real title available?)
• Monoidal bicategories and Hopf algebroids
• Networks of open systems
• Petri nets are monoids
• Process algebras for Petri nets. The alphabetization of distributed systems
• Structured cospans
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
• The reachability problem for Petri nets is not elementary

Cited in

(28)

• Rule-based epidemic models
• A congruence for Petri nets
• Executions in (semi-)integer Petri nets are compact closed categories
• Petri nets based on Lawvere theories
• Open Petri Nets: Non-deterministic Processes and Compositionality
• scientific article; zbMATH DE number 1215062 (Why is no real title available?)
• Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
• Coarse-graining open Markov processes
• Compositional semantics for open Petri nets based on deterministic processes
• scientific article; zbMATH DE number 7453976 (Why is no real title available?)
• Double categories of open dynamical systems (extended abstract)
• Network models from Petri nets with catalysts
• A categorical semantics for guarded Petri nets
• Structured cospans
• A categorical semantics for bounded Petri nets
• Situated transition systems
• Whole-grain Petri nets and processes
• Intraspecific and monotone enzyme catalysis with oscillatory substrate and inhibitor supplies
• A categorical semantics for hierarchical Petri nets
• A compositional approach to parity games
• A compositional framework for Petri nets
• Dialectica Petri nets
• Presheaf automata
• Constructor theory as process theory
• Operads for complex system design specification, analysis and synthesis
• Differentiable causal computations via delayed trace (extended version)
• Compositional separation of control flow and data flow
• Petri nets are monoids

This page was built for publication: Open Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139283)