Siphon control is a widespread methodology for deadlock prevention (DP) in Petri net (PN) models. Besides achieving liveness or DP, control methods should also be evaluated regarding their permissivity (in terms of the number of allowed states) and constraint redundancy. This work introduces a partitioning of the reachability graph based on strongly connected components that nicely and compactly illustrates the PN’s evolution behavior, especially regarding liveness, deadlocks and siphon-related properties. The resulting reduced graph is used as a tool for the analysis of DP methods in bounded PNs, to reveal the use of non-maximally permissive constraints and constraint overlapping.
A reachability graph partitioning technique for the analysis of deadlock prevention methods in bounded Petri nets
PIRODDI, LUIGI;
2010-01-01
Abstract
Siphon control is a widespread methodology for deadlock prevention (DP) in Petri net (PN) models. Besides achieving liveness or DP, control methods should also be evaluated regarding their permissivity (in terms of the number of allowed states) and constraint redundancy. This work introduces a partitioning of the reachability graph based on strongly connected components that nicely and compactly illustrates the PN’s evolution behavior, especially regarding liveness, deadlocks and siphon-related properties. The resulting reduced graph is used as a tool for the analysis of DP methods in bounded PNs, to reveal the use of non-maximally permissive constraints and constraint overlapping.| File | Dimensione | Formato | |
|---|---|---|---|
|
2010 - ACC - FumagalliPiroddiCordone.pdf
Accesso riservato
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
170.46 kB
Formato
Adobe PDF
|
170.46 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
