Paper Info
Title
An algorithm to compute the minimal siphons in S 4 PR nets.
Abstract
Abstract Minimal siphons in the class of S 4 PR nets have become a conceptual and practical central tool for the study of the resource allocation related aspects in discrete event dynamic systems as, for example, the existence of deadlocks. Therefore the availability of efficient algorithms to compute the minimal siphons is essential. In this paper we try to take advantage of the particular properties of the siphons in S 4 PR to obtain an efficient algorithm. These properties allow us to express minimal siphons as the union of pruned minimal siphons containing only one resource. The pruning operation is built from the binary pruning relation defined on the set of minimal siphons containing only one resource. This pruning relation is represented by means of a directed graph. The computation of the minimal siphons is based on the maximal strongly connected components of this graph. The algorithm is highly economic in memory in all intermediate steps when compared to the classical algorithms.
Year
DOI
Venue
2012
10.1007/s10626-012-0132-4
Discrete Event Dynamic Systems
Keywords
Field
DocType
Petri-nets,Structural analysis,Siphons,Graph theory,Strongly connected component
Graph theory,Discrete mathematics,Mathematical optimization,Petri net,Deadlock,Directed graph,Algorithm,Resource allocation,Strongly connected component,Mathematics,Binary number,Computation
Journal
Volume
Issue
ISSN
22
4
1573-7594
Citations 
PageRank 
References 
4
0.41
15
Authors
3
Name
Order
Citations
PageRank
Elia Esther Cano1141.28
Carlos A. Rovetto2192.76
José Manuel Colom334131.92