<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>3</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>E. Cano</AUTHOR>
		<AUTHOR>C. Rovetto</AUTHOR>
		<AUTHOR>J.M. Colom</AUTHOR>
	</AUTHORS>
	<YEAR>2010</YEAR>
	<TITLE>On the Computation of the Minimal Siphons of $S^4PR$ Nets from a Generating Family of Siphons</TITLE>
	<SECONDARY_TITLE>15th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA&acirc;€™2010)</SECONDARY_TITLE>
	<PLACE_PUBLISHED>Bilbao, Spain</PLACE_PUBLISHED>
	<PAGES>paper MF-002879</PAGES>
	<DATE>09/2010</DATE>
	<ABSTRACT>Minimal siphons in the class of $S^4PR$ 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 $S^4PR$ 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.</ABSTRACT>
</RECORD>
</RECORDS></XML>