Executions in (Semi-)Integer Petri Nets are Compact Closed Categories

05/15/2018
by   Fabrizio Romano Genovese, et al.
0

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 that a procedure to recover the original net from its category of executions exists, 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2022

Token Multiplicity in Reversing Petri Nets Under the Individual Token Interpretation

Reversing Petri nets (RPNs) have recently been proposed as a net-basedap...
research
11/20/2019

Synthesis of Reduced Asymmetric Choice Petri Nets

A Petri net is choice-free if any place has at most one transition in it...
research
01/29/2021

A Categorical Semantics for Hierarchical Petri Nets

We show how a particular flavor of hierarchical nets, where the firing o...
research
01/03/2017

Ambiguity and Incomplete Information in Categorical Models of Language

We investigate notions of ambiguity and partial information in categoric...
research
04/07/2021

Maximal and minimal dynamic Petri net slicing

Context: Petri net slicing is a technique to reduce the size of a Petri ...
research
04/07/2019

Network Models from Petri Nets with Catalysts

Petri networks and network models are two frameworks for the composition...
research
06/21/2018

Universal Safety for Timed Petri Nets is PSPACE-complete

A timed network consists of an arbitrary number of initially identical 1...

Please sign up or login with your details

Forgot password? Click here to reset