On the computation of the minimal siphons of S4PR nets from a generating family of siphons
Minimal siphons in the class of S 4 PR 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 w...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 8 |
|---|---|
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Cano, E E Rovetto, C A Colom, J |
| description | Minimal siphons in the class of S 4 PR 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 4 PR 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. |
| doi_str_mv | 10.1109/ETFA.2010.5641317 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5641317</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5641317</ieee_id><sourcerecordid>5641317</sourcerecordid><originalsourceid>FETCH-ieee_primary_56413173</originalsourceid><addsrcrecordid>eNp9j7-OwjAMhw0HEnDXB0C3-AWApDj9M6ITiA0ETCwoOqUQ1CRVUwbenoAqRrxY_j7_LBlgzNmUc5bPlofVYhqzMIqE-JynHYjyNOMUEyWZYFkXhjynZMJSkX_BqBWUid5bEBtA5P2VhSIRYDyE48Zic1H470x1a2SjnUVXvJDRVhtZotfVxVn_xHva7tCqxmNRO4MSz8qqOqTsGQtpdHl_brWBH-gXsvQqavs3_K6Wh7_1RCulTlUdjtf3U_vO_LN9AJV3SCQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>On the computation of the minimal siphons of S4PR nets from a generating family of siphons</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Cano, E E ; Rovetto, C A ; Colom, J</creator><creatorcontrib>Cano, E E ; Rovetto, C A ; Colom, J</creatorcontrib><description>Minimal siphons in the class of S 4 PR 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 4 PR 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.</description><identifier>ISSN: 1946-0740</identifier><identifier>ISBN: 1424468485</identifier><identifier>ISBN: 9781424468485</identifier><identifier>EISSN: 1946-0759</identifier><identifier>EISBN: 9781424468508</identifier><identifier>EISBN: 9781424468492</identifier><identifier>EISBN: 1424468507</identifier><identifier>EISBN: 1424468493</identifier><identifier>DOI: 10.1109/ETFA.2010.5641317</identifier><language>eng</language><publisher>IEEE</publisher><subject>Availability ; Flexible manufacturing systems ; Labeling ; Petri nets ; Production ; Robots ; System recovery</subject><ispartof>2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010), 2010, p.1-8</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5641317$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5641317$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Cano, E E</creatorcontrib><creatorcontrib>Rovetto, C A</creatorcontrib><creatorcontrib>Colom, J</creatorcontrib><title>On the computation of the minimal siphons of S4PR nets from a generating family of siphons</title><title>2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)</title><addtitle>ETFA</addtitle><description>Minimal siphons in the class of S 4 PR 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 4 PR 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.</description><subject>Availability</subject><subject>Flexible manufacturing systems</subject><subject>Labeling</subject><subject>Petri nets</subject><subject>Production</subject><subject>Robots</subject><subject>System recovery</subject><issn>1946-0740</issn><issn>1946-0759</issn><isbn>1424468485</isbn><isbn>9781424468485</isbn><isbn>9781424468508</isbn><isbn>9781424468492</isbn><isbn>1424468507</isbn><isbn>1424468493</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNp9j7-OwjAMhw0HEnDXB0C3-AWApDj9M6ITiA0ETCwoOqUQ1CRVUwbenoAqRrxY_j7_LBlgzNmUc5bPlofVYhqzMIqE-JynHYjyNOMUEyWZYFkXhjynZMJSkX_BqBWUid5bEBtA5P2VhSIRYDyE48Zic1H470x1a2SjnUVXvJDRVhtZotfVxVn_xHva7tCqxmNRO4MSz8qqOqTsGQtpdHl_brWBH-gXsvQqavs3_K6Wh7_1RCulTlUdjtf3U_vO_LN9AJV3SCQ</recordid><startdate>201009</startdate><enddate>201009</enddate><creator>Cano, E E</creator><creator>Rovetto, C A</creator><creator>Colom, J</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201009</creationdate><title>On the computation of the minimal siphons of S4PR nets from a generating family of siphons</title><author>Cano, E E ; Rovetto, C A ; Colom, J</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_56413173</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Availability</topic><topic>Flexible manufacturing systems</topic><topic>Labeling</topic><topic>Petri nets</topic><topic>Production</topic><topic>Robots</topic><topic>System recovery</topic><toplevel>online_resources</toplevel><creatorcontrib>Cano, E E</creatorcontrib><creatorcontrib>Rovetto, C A</creatorcontrib><creatorcontrib>Colom, J</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cano, E E</au><au>Rovetto, C A</au><au>Colom, J</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>On the computation of the minimal siphons of S4PR nets from a generating family of siphons</atitle><btitle>2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010)</btitle><stitle>ETFA</stitle><date>2010-09</date><risdate>2010</risdate><spage>1</spage><epage>8</epage><pages>1-8</pages><issn>1946-0740</issn><eissn>1946-0759</eissn><isbn>1424468485</isbn><isbn>9781424468485</isbn><eisbn>9781424468508</eisbn><eisbn>9781424468492</eisbn><eisbn>1424468507</eisbn><eisbn>1424468493</eisbn><abstract>Minimal siphons in the class of S 4 PR 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 4 PR 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><pub>IEEE</pub><doi>10.1109/ETFA.2010.5641317</doi></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1946-0740 |
| ispartof | 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010), 2010, p.1-8 |
| issn | 1946-0740 1946-0759 |
| language | eng |
| recordid | cdi_ieee_primary_5641317 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Availability Flexible manufacturing systems Labeling Petri nets Production Robots System recovery |
| title | On the computation of the minimal siphons of S4PR nets from a generating family of siphons |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T15%3A35%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=On%20the%20computation%20of%20the%20minimal%20siphons%20of%20S4PR%20nets%20from%20a%20generating%20family%20of%20siphons&rft.btitle=2010%20IEEE%2015th%20Conference%20on%20Emerging%20Technologies%20&%20Factory%20Automation%20(ETFA%202010)&rft.au=Cano,%20E%20E&rft.date=2010-09&rft.spage=1&rft.epage=8&rft.pages=1-8&rft.issn=1946-0740&rft.eissn=1946-0759&rft.isbn=1424468485&rft.isbn_list=9781424468485&rft_id=info:doi/10.1109/ETFA.2010.5641317&rft_dat=%3Cieee_6IE%3E5641317%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424468508&rft.eisbn_list=9781424468492&rft.eisbn_list=1424468507&rft.eisbn_list=1424468493&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5641317&rfr_iscdi=true |