Corpus ID: 231741228

A Categorical Semantics for Hierarchical Petri Nets

@article{Genovese2021ACS,
title={A Categorical Semantics for Hierarchical Petri Nets},
author={Fabrizio Genovese and Jelle Herold},
journal={ArXiv},
year={2021},
volume={abs/2102.00096}
}
• Published 29 January 2021
• Computer Science, Mathematics
• ArXiv
We show how a particular flavor of hierarchical nets, where the firing of a transition in the parent net must correspond to an execution in some child net, can be modelled utilizing a functorial semantics from a free category – representing the parent net – to the category of sets and spans between them. This semantics can be internalized via Grothendieck construction, resulting in the category of executions of a Petri net representing the semantics of the overall hierarchical net. We conclude… Expand
1 Citations

Figures from this paper

The Cost of Compositionality: A High-Performance Implementation of String Diagram Composition
• Computer Science, Mathematics
• ArXiv
• 2021
This work introduces a data structure representing string diagrams in terms of adjacency matrices, which has the key advantage of providing simple and efficient algorithms for composition and tensor product of diagrams. Expand

References

SHOWING 1-10 OF 24 REFERENCES
Executions in (Semi-)Integer Petri Nets are Compact Closed Categories
• Mathematics, Computer Science
• QPL
• 2018
This work uses compact closeness to infer that allowing negative tokens in a Petri net makes the causal relations between transition firings non-trivial, and this is used to model interesting phenomena in economics and computer science. Expand
A Categorical Semantics for Bounded Petri Nets
• Computer Science, Mathematics
• ArXiv
• 2021
A categorical semantics for bounded Petri nets, both in the collective and individual-token philosophy, and proves, in both cases, that the internal and external constructions are equivalent, by using machinery built on top of the Grothendieck construction. Expand
On the Category of Petri Net Computations
• V. Sassone
• Mathematics, Computer Science
• TAPSOFT
• 1995
This work identifies a coreflection right adjoint to $${\cal Q}$$[_] and characterize its replete image, thus yielding an axiomatization of the category of net computations. Expand
A Survey of Decidability Results for Elementary Object Systems
This work studies the relationship of EOS to existing Petri net formalisms and investigates the sub-class of generalised state machines, which combines decidability of many theoretically interesting properties with a quite rich practical modelling expressiveness. Expand
Petri Nets Are Monoids
• Computer Science, Mathematics
• Inf. Comput.
• 1990
A formal basis for expressing the semantics of concurrent languages in terms of Petri nets is provided, and a new understanding of concurrency in Terms of algebraic structures over graphs and categories is provided. Expand
Open Petri nets
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
• 2020
Two forms of semantics for open Petri nets are described using symmetric monoidal double functors out of pen(Petri), including an operational semantics and a reachability semantics that simply says which markings of the outputs can be reached from a given marking of the inputs. Expand
Computational Petri Nets: Adjunctions Considered Harmful
• Mathematics, Computer Science
• ArXiv
• 2019
This work reviews some of the endeavors in trying to connect Petri nets with free symmetric monoidal categories, and introduces an Idris library which implements them, showing how previous approaches do not satisfy these requirements. Expand
Coloured Petri Nets
• K. Jensen
• Computer Science
• EATCS Monographs in Theoretical Computer Science
• 1992
All users of CP-nets are forced to make simulations because it is impossible to construct a CP-net without thinking about the possible effects of the individual transitions, and the proper question is not whether the modeller should make simulations or not, but whether he wants computer support for the simulation activity. Expand
Specifying Interaction Categories
• Computer Science
• Category Theory and Computer Science
• 1997
All familiar examples of interaction categories, as well as some new ones, can be built starting from some familiar categories, by combining two complementary methods for obtaining models of typed process calculi, in the form of interaction category. Expand
The Mathematical Specification of the Statebox Language
• Computer Science, Mathematics
• ArXiv
• 2019
This document defines the mathematical backbone of the Statebox programming language, and it is deemed very useful to release it to the public to help people wanting to audit the authors' work to better understand the code itself. Expand