By Topic

On the computation of the minimal siphons of S4PR nets from a generating family of siphons

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Cano, E.E. ; Dept. of Comput. Sci. & Syst. Eng., Univ. of Zaragoza, Zaragoza, Spain ; Rovetto, C.A. ; Colom, J.

Minimal siphons in the class of S4PR nets have become a conceptual and practical central tool to deal with deadlocks caused by the sharing of resources in Flexible Manufacturing Systems. The availability of efficient algorithms to compute these structural objects is very important. In this paper we take advantage from the particular properties of the siphons in S4PR to obtain an efficient algorithm. These properties allow to compute the minimal siphons from a generating family of minimal siphons. This family is composed by the minimal siphons containing only one resource. The computation of the minimal siphons is based in the maximal strongly connected components of a graph representing the relations between the siphons of the generating family. The algorithm is very economic in memory in all intermediate steps with respect to the classical algorithms.

Published in:

Emerging Technologies and Factory Automation (ETFA), 2010 IEEE Conference on

Date of Conference:

13-16 Sept. 2010