Paper Info
Title
Computing minimal siphons in Petri net models of resource allocation systems: a parallel solution
Abstract
Siphons are related to the liveness properties of Petri net models. This relation is strong in the case of resource allocation systems (RASs). Siphons can be used in these systems in order to both characterize and prevent/avoid deadlock situations. However, the computation of these structural components can be very time consuming or, even, impossible. Moreover, if, in general, the complete enumeration of the set of minimal siphons must be avoided (there can exist an exponential number of such components), some deadlock prevention methods rely on its (complete or partial) computation and enumeration. The special syntactical constraints of some classes of RASs can help in developing specific algorithms to compute siphons in a more efficient way. In this work, a known method for siphon computation is adapted to get advantage of the special (syntactical) structure of a class of RASs; a parallel implementation is proposed and some experimental results are presented
Year
DOI
Venue
2006
10.1109/TSMCA.2005.855751
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions
Keywords
DocType
Volume
Petri nets,concurrency control,flexible manufacturing systems,parallel processing,resource allocation,Petri net models,deadlock prevention method,parallel computation,resource allocation systems,siphon computation,Parallel computation,Petri nets,siphons,structural properties
Journal
36
Issue
ISSN
Citations 
3
1083-4427
15
PageRank 
References 
Authors
0.67
9
2
Name
Order
Citations
PageRank
Tricas, F.1150.67
J. Ezpeleta269144.37