2011
DOI: 10.1007/s10626-011-0124-9
|View full text |Cite
|
Sign up to set email alerts
|

An iterative method for synthesizing non-blocking supervisors for a class of generalized Petri nets using mathematical programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
43
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 20 publications
(43 citation statements)
references
References 28 publications
0
43
0
Order By: Relevance
“…This work considers deadlock problems for a class of manufacturing-oriented Petri nets, namely, G-systems first proposed in Barkaoui et al 46 For more details, the preliminaries of Petri nets and the definitions of G-systems can refer to the previous work in Zhao and Hou. 47 First, this section presents an extraction algorithm of LICs under given resource partial orders for a G-system configuration. As known, a G-system net with concurrent processes may fall into permanent blocking since the circular wait of shared resources may occur among multiple processes.…”
Section: Lics Extraction Methods For G-systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…This work considers deadlock problems for a class of manufacturing-oriented Petri nets, namely, G-systems first proposed in Barkaoui et al 46 For more details, the preliminaries of Petri nets and the definitions of G-systems can refer to the previous work in Zhao and Hou. 47 First, this section presents an extraction algorithm of LICs under given resource partial orders for a G-system configuration. As known, a G-system net with concurrent processes may fall into permanent blocking since the circular wait of shared resources may occur among multiple processes.…”
Section: Lics Extraction Methods For G-systemsmentioning
confidence: 99%
“…The corresponding augmented version is then obtained after two transitions t à 1 and t à 2 are added, where i 1 = o 1 = ft à 1 g and i 2 = o 2 = ft à 2 g, which is shown in Figure 1(b). From the definitions of G-systems in Zhao and Hou, 47 we have P 0 = A resource place in a net system is modeled with a singleton place whose token capacity represents the ability of processing raw parts concurrently.…”
Section: Let O J Be a Sink Place In A Subsystemmentioning
confidence: 99%
“…It can be verified that the controlled system has 62,771 reachable states. It means that the corresponding supervisor obtained by the method of Zhao and Hou 49 can provide 94.5% (62,771/66,400) of the optimal permissive behavior. Note that the permissive behavior of the supervisor depends on the control-induced siphons control stage.…”
Section: Bi Pi Imentioning
confidence: 99%
“…First, a G-system example is considered to illustrate the design steps in detail. Then, the performance comparison of non-blocking supervisors is made among different deadlock control polices in Li and Zhao 37 and Zhao and Hou, 49 and some discussion is also given subsequently.…”
Section: A Case Studymentioning
confidence: 99%
“…Furthermore, deadlocks may give rise to catastrophic results in some AMSs such as semiconductor manufacturing systems. Therefore, trying to resolve deadlock issues in AMSs has received significant attention, and there have been a large number of research achievements (Chao, 2012;Chen et al, 2013;Chu & Xie, 1997;Cordone & Piroddi, 2013;Esther et al, 2012;Ezpeleta & Valk, 2006;Hu et al, 2013;Huang, Pan, & Zhou, 2012;Lewis et al, 1998;Liu et al, 2014;Nazeem & Reveliotis, 2012;Park & Reveliotis, 2001;Piroddi et al, 2009;Reveliotis & Nazeem, 2013;Tricas & Ezpeleta, 2006;Uzam et al, 2007;Wang et al, 2013;Xing et al, 2009;Zhang & Judd, 2008;Zhao & Hou, 2013).…”
Section: Introductionmentioning
confidence: 99%