Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Shou Guang Wang; Meng Chu Zhou; Cheng Ying Wang

doi:10.1109/CASE.2011.6042447

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Shou Guang Wang, Meng Chu Zhou, Cheng Ying Wang

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

Original language	English (US)
Title of host publication	2011 IEEE International Conference on Automation Science and Engineering, CASE 2011
Pages	399-404
Number of pages	6
DOIs	https://doi.org/10.1109/CASE.2011.6042447
State	Published - 2011
Event	2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011 - Trieste, Italy Duration: Aug 24 2011 → Aug 27 2011

Publication series

Name	IEEE International Conference on Automation Science and Engineering
ISSN (Print)	2161-8070
ISSN (Electronic)	2161-8089

Other

Other	2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011
Country/Territory	Italy
City	Trieste
Period	8/24/11 → 8/27/11

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/CASE.2011.6042447

Cite this

Wang, S. G., Zhou, M. C., & Wang, C. Y. (2011). Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets. In 2011 IEEE International Conference on Automation Science and Engineering, CASE 2011 (pp. 399-404). Article 6042447 (IEEE International Conference on Automation Science and Engineering). https://doi.org/10.1109/CASE.2011.6042447

@inproceedings{fef8f631cb274b04bd7df89d5f1f0503,

title = "Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets",

abstract = "Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.",

author = "Wang, {Shou Guang} and Zhou, {Meng Chu} and Wang, {Cheng Ying}",

year = "2011",

doi = "10.1109/CASE.2011.6042447",

language = "English (US)",

isbn = "9781457717307",

series = "IEEE International Conference on Automation Science and Engineering",

pages = "399--404",

booktitle = "2011 IEEE International Conference on Automation Science and Engineering, CASE 2011",

note = "2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011 ; Conference date: 24-08-2011 Through 27-08-2011",

}

Wang, SG, Zhou, MC & Wang, CY 2011, Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets. in 2011 IEEE International Conference on Automation Science and Engineering, CASE 2011., 6042447, IEEE International Conference on Automation Science and Engineering, pp. 399-404, 2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011, Trieste, Italy, 8/24/11. https://doi.org/10.1109/CASE.2011.6042447

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets. / Wang, Shou Guang; Zhou, Meng Chu; Wang, Cheng Ying.
2011 IEEE International Conference on Automation Science and Engineering, CASE 2011. 2011. p. 399-404 6042447 (IEEE International Conference on Automation Science and Engineering).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

AU - Wang, Shou Guang

AU - Zhou, Meng Chu

AU - Wang, Cheng Ying

PY - 2011

Y1 - 2011

N2 - Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

AB - Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

UR - http://www.scopus.com/inward/record.url?scp=82455175426&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=82455175426&partnerID=8YFLogxK

U2 - 10.1109/CASE.2011.6042447

DO - 10.1109/CASE.2011.6042447

M3 - Conference contribution

AN - SCOPUS:82455175426

SN - 9781457717307

T3 - IEEE International Conference on Automation Science and Engineering

SP - 399

EP - 404

BT - 2011 IEEE International Conference on Automation Science and Engineering, CASE 2011

T2 - 2011 7th IEEE International Conference on Automation Science and Engineering, CASE 2011

Y2 - 24 August 2011 through 27 August 2011

ER -

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this