In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition. Here we show that, along the same lines, by adding an (idempotent) operation and thus taking dioids (commutative semirings) rather than monoids, one can faithfully characterise the non-deterministic computations of a Petri net.
Petri nets are dioids
GADDUCCI, FABIO
2008-01-01
Abstract
In a seminal paper Montanari and Meseguer showed that an algebraic interpretation of Petri nets in terms of commutative monoids can be used to provide an elegant characterisation of the deterministic computations of a net, accounting for their sequential and parallel composition. Here we show that, along the same lines, by adding an (idempotent) operation and thus taking dioids (commutative semirings) rather than monoids, one can faithfully characterise the non-deterministic computations of a Petri net.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
amast2008.pdf
solo utenti autorizzati
Tipologia:
Versione finale editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
589.69 kB
Formato
Adobe PDF
|
589.69 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
