Executions in (Semi-)Integer Petri Nets are Compact Closed Categories
arXiv:1805.05988 · doi:10.4204/EPTCS.287.7
Abstract
In this work, we analyse Petri nets where places are allowed to have a negative number of tokens. For each net we build its correspondent category of executions, which is compact closed, and prove that this procedure is functorial. We moreover exhibit a procedure to recover the original net from its category of executions, show that it is again functorial, and that this gives rise to an adjoint pair. Finally, we use compact closeness to infer that allowing negative tokens in a Petri net makes the causal relations between transition firings non-trivial, and we use this to model interesting phenomena in economics and computer science.
arXiv commentIn Proceedings QPL 2018, arXiv:1901.09476
References in corpus (1)
Cited by in corpus (10)
- Computational Petri Nets: Adjunctions Considered Harmful
- Petri Nets Based on Lawvere Theories
- The Mathematical Specification of the Statebox Language
- Compositional Cyber-Physical Systems Theory
- A Categorical Semantics for Hierarchical Petri Nets
- Nets with Mana: A Framework for Chemical Reaction Modelling
- A Categorical Semantics for Guarded Petri Nets
- A Categorical Semantics for Bounded Petri Nets
- idris-ct: A Library to do Category Theory in Idris
- Composing Behaviors of Networks