Computational Petri Nets: Adjunctions Considered Harmful

04/29/2019
by   Fabrizio Genovese, et al.
0

We review some of the endeavors in trying to connect Petri nets with free symmetric monoidal categories. We give a list of requirement such connections should respect if they are meant to be useful for practical/implementation purposes. We show how previous approaches do not satisfy them, and give compelling evidence that this depends on trying to make the correspondence functorial in the direction from nets to free symmetric monoidal categories, in order to produce an adjunction. We show that dropping this immediately honors our desiderata, and conclude by introducing an Idris library which implements them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2020

Dialectica Fuzzy Petri Nets

Brown and Gurr have introduced a model of Petri Nets that is based on de...
research
12/27/2017

Rewriting in Free Hypegraph Categories

We study rewriting for equational theories in the context of symmetric m...
research
08/16/2018

Open Petri Nets

The reachability semantics for Petri nets can be studied using open Petr...
research
12/27/2017

Rewriting in Free Hypergraph Categories

We study rewriting for equational theories in the context of symmetric m...
research
07/17/2018

Unifying Inference for Bayesian and Petri Nets

Recent work by the authors equips Petri occurrence nets (PN) with probab...
research
09/14/2021

Coverability, Termination, and Finiteness in Recursive Petri Nets

In the early two-thousands, Recursive Petri nets have been introduced in...
research
03/10/2021

Evaluating Linear Functions to Symmetric Monoidal Categories

A number of domain specific languages, such as circuits or data-science ...

Please sign up or login with your details

Forgot password? Click here to reset