A categorical semantics for bounded Petri nets
From MaRDI portal
Publication:6153327
zbMATH Open1530.68192arXiv2101.09100MaRDI QIDQ6153327FDOQ6153327
Authors: Fosco Loregiàn, Daniele Palombi
Publication date: 13 February 2024
Full work available at URL: https://arxiv.org/abs/2101.09100
Recommendations
Categorical semantics of formal languages (18C50) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Introduction to bicategories
- Understanding Petri Nets
- Petri nets are monoids
- Connector algebras for C/E and P/T nets' interactions
- Encoding Asynchronous Interactions Using Open Petri Nets
- Title not available (Why is that?)
- On the category of Petri net computations
- A compositional framework for reaction networks
- Universal Petri net
- Petri nets based on Lawvere theories
- Open Petri nets
Cited In (1)
This page was built for publication: A categorical semantics for bounded Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153327)