Open Petri nets
From MaRDI portal
Publication:5139283
DOI10.1017/S0960129520000043zbMath1457.68177arXiv1808.05415MaRDI QIDQ5139283
Publication date: 8 December 2020
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.05415
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50) 2-categories, bicategories, double categories (18N10) Monoidal categories, symmetric monoidal categories (18M05)
Related Items
Unnamed Item, Unnamed Item, Rule-based epidemic models, Structured Cospans, Petri nets based on Lawvere theories
Cites Work
- An axiomatization of the algebra of Petri net concatenable processes
- Configuration structures, event structures and Petri nets
- Petri nets are monoids
- Monoidal bicategories and Hopf algebroids
- Networks of open systems
- Functorial models for Petri nets
- Process algebras for Petri nets. The alphabetization of distributed systems
- Categories of continuous functors. I
- Compact Closed Bicategories
- Connector algebras for C/E and P/T nets' interactions
- A Connector Algebra for P/T Nets Interactions
- Compositional Reachability in Petri Nets
- Asynchronous Traces and Open Petri Nets
- Coloured Petri Nets
- An Algorithm for the General Petri Net Reachability Problem
- An axiomatization of the category of Petri net computations
- Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
- Demystifying Reachability in Vector Addition Systems
- Coarse-Graining Open Markov Processes
- Compositional semantics for open Petri nets based on deterministic processes
- Structured Cospans
- The reachability problem for Petri nets is not elementary
- Bicategories of Markov Processes
- A bicategory of decorated cospans
- A compositional framework for reaction networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
