The paper addresses the problem of computing siphons and traps in a standard Petri net. In particular, starting from a clear formulation in terms of predicate logic, it is shown how binary programming techniques can be adopted to formulate and solve the problem of finding minimal and basis siphons. An experimental campaign on a large set of random test instances proves the effectiveness of the method when compared to a constructive one.
Characterization of Minimal and Basis Siphons with Predicate Logic and Linear Programming
FERRARINI, LUCA;PIRODDI, LUIGI
2002-01-01
Abstract
The paper addresses the problem of computing siphons and traps in a standard Petri net. In particular, starting from a clear formulation in terms of predicate logic, it is shown how binary programming techniques can be adopted to formulate and solve the problem of finding minimal and basis siphons. An experimental campaign on a large set of random test instances proves the effectiveness of the method when compared to a constructive one.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2002 - CACSD - CordoneFerrariniPiroddi.pdf
Accesso riservato
Descrizione: Articolo principale
:
Publisher’s version
Dimensione
114.27 kB
Formato
Adobe PDF
|
114.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
