Robust deadlock control for automated manufacturing systems with an unreliable resource

Wu, Yunchao; Xing, Keyi; Luo, Jianchao; Feng, Yanxiang

doi:10.1016/j.ins.2016.01.049

Cited by 46 publications

(88 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, the proposed method is valid, it can give sufficiently accurate results, and it can potentially be applied to other cases. Piroddi et al [24] Chen and Li [25] Chen et al [26] TCCPN [26][27][28][29] Proposed method Chen and Li [25] Chen et al [26] Piroddi et al [24] Chen and Li [25] Chen et al [26] TCCPN [26][27][28][29] Proposed method…”

Section: Case Studymentioning

confidence: 99%

“…Chen et al [8] Piroddi et al[24] Chen and Li[25] Chen et al[26] TCCPN[26][27][28][29] . [8] Piroddi et al [24] Chen and Li [25] Chen et al [26] TCCPN [26-29] Chen et al [8] Piroddi et al [24] Chen and Li [25] Chen et al [26] TCCPN [26-29] Proposed method Time Throughput time of Part B Comparison of throughput time of Part A for the Petri net model from Figure 11.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Single Controller-Based Colored Petri Nets for Deadlock Control in Automated Manufacturing Systems

Kaid

Al-Ahmari

et al. 2019

Processes

View full text Add to dashboard Cite

Deadlock control approaches based on Petri nets are usually implemented by adding control places and related arcs to the Petri net model of a system. The main disadvantage of the existing policies is that many control places and associated arcs are added to the initially constructed Petri net model, which significantly increases the complexity of the supervisor of the Petri net model. The objective of this study is to develop a two-step robust deadlock control approach. In the first step, we use a method of deadlock prevention based on strict minimal siphons (SMSs) to create a controlled Petri net model. In the second step, all control places obtained in the first step are merged into a single control place based on the colored Petri net to mark all SMSs. Finally, we compare the proposed method with the existing methods from the literature.

show abstract

Section: Case Studymentioning

confidence: 99%

mentioning

confidence: 99%

Single Controller-Based Colored Petri Nets for Deadlock Control in Automated Manufacturing Systems

Kaid

Al-Ahmari

et al. 2019

Processes

View full text Add to dashboard Cite

show abstract

“…(ii) The second class of events taking place in the considered s-DES G(Φ) is the event set E = {R 1 fail, R 4 fail, R 1 repair, R 4 repair}, that contains all the resource failing and restoration events. The s 0 (0, 0, 0, 0, 0, 0, 0) s 1 (1, 0, 0, 0, 0, 0, 0) s 2 (0, 0, 1, 0, 0, 0, 0) s 3 (0, 0, 0, 1, 0, 0, 0) s 4 (0, 1, 0, 0, 0, 0, 0) s 5 (1, 0, 1, 0, 0, 0, 0) s 6 (1, 0, 0, 1, 0, 0, 0) s 7 (0, 0, 1, 1, 0, 0, 0) s 8 (0, 0, 0, 0, 1, 0, 0) s 9 (0, 1, 1, 0, 0, 0, 0) s 10 (0, 1, 0, 1, 0, 0, 0) s 11 (1, 0, 1, 1, 0, 0, 0) s 12 (1, 0, 0, 0, 1, 0, 0) s 13 (0, 0, 0, 1, 1, 0, 0) s 14 (0, 0, 0, 0, 0, 1, 0) s 15 (0, 1, 1, 1, 0, 0, 0) s 16 (0, 1, 0, 0, 1, 0, 0) s 17 (1, 0, 0, 1, 1, 0, 0) s 18 (1, 0, 0, 0, 0, 1, 0) s 19 (0, 0, 0, 1, 0, 1, 0) s 20 (0, 0, 0, 0, 0, 0, 1) s 21 (0, 1, 0, 1, 1, 0, 0) s 22 (0, 1, 0, 0, 0, 1, 0) s 23 (1, 0, 0, 1, 0, 1, 0) s 24 (0, 0, 0, 1, 0, 0, 1) s 25 (0, 0, 1, 0, 0, 0, 1) s 26 (0, 1, 0, 1, 0, 1, 0) s 27 (0, 0, 1, 1, 0, 0, 1) s 28 (0, 0, 0, 0, 1, 0, 1) s 29 (0, 0, 0, 1, 1, 0, 1) s 30 (0, 0, 0, 0, 0, 1, 1) s 31 (0, 0, 0, 1, 0, 1, 1)…”

Section: )mentioning

confidence: 99%

“…Furthermore, all the developments of [24] are contingent upon the condition that each process type utilizes at most one of the failing processors. More recently, the works appearing in [25], [26], [27], [28] have tried to extend further the developments of [22], [24] to some RAS classes that are characterized by increased routing flexibility and / or additional special structure that impacts the underlying notion of RAS state safety. This new set of results employ a PN-based modeling framework, instead of the Finite State Automata (FSA) that were used in the original works of [22], [24], and the synthesized "robust" DAPs are employing insights and results regarding the synthesis of liveness-enforcing supervisors (LES) for RAS-modeling PNs.…”

Section: Introductionmentioning

confidence: 99%

Robust deadlock avoidance for sequential resource allocation systems with resource outages

Reveliotis

Fei

2016

2016 IEEE International Conference on Automation Science and Engineering (CASE)

View full text Add to dashboard Cite

While the supervisory control (SC) problem of (maximally permissive) deadlock avoidance for sequential resource allocation systems (RAS) has been extensively studied in the literature, the corresponding results that are able to address potential resource outages are quite limited, both, in terms of their volume but also in terms of their control capability. This work leverages the recently developed SC theory for switched Discrete Event Systems (s-DES) in order to provide a novel systematic treatment of this more complicated version of the RAS deadlock avoidance problem. Following the modeling paradigm of s-DES, both, the operation of the considered RAS and the corresponding maximally permissive SC policy are decomposed over a number of operational modes that are defined by the running sets of the failing resources. In particular, the target supervisor must be decomposed to a set of "localized predicates", where each predicate is associated with one of the operational modes. A significant part, and a primary contribution, of this work concerns the development of these localized predicates that will enable the formal characterization and the effective computation of the sought supervisor. With these predicates available, a distributed representation for the sought supervisor, that is appropriate for real-time implementation, is eventually obtained through an adaptation of the relevant distributed algorithm that is provided by the current s-DES SC theory.Note to Practitioners -This paper extends the existing theory of deadlock avoidance for buffer-space allocation in flexibly automated production systems so that it accounts for disruptive effects due to potential temporary outages of some of the system servers. The set of the failing servers at any time instant defines the corresponding operational mode for the underlying resource allocation system (RAS). The primary problem that is addressed by this paper is the synthesis of a resource allocation policy that will ensure the ability of all process instances that do not require the failing resources in a particular mode, to execute repetitively and complete successfully while the system remains in that mode. In line with some past literature on this problem, we call the corresponding supervisory control problem as "robust deadlock avoidance", and we leverage results from the recently emerged theory for modeling and control of switched Discrete Event Systems (s-DES) in order to characterize and compute a maximally permissive solution for it.

show abstract

“…Research results about robust control and fault tolerant control for AMSs with unreliable resources can be found in [2][3][4][7][8][9][10]12,15,17,21,23,[36][37][38][39]. Lawley [10] develops a supervisory control policy for production systems with a single unreliable resource.…”

Section: Introductionmentioning

confidence: 99%

Deadlock and Blockage Control of Automated Manufacturing Systems with an Unreliable Resource

Luo

Xing

Zhou

2018

Asian Journal of Control

Self Cite

View full text Add to dashboard Cite

This work studies the deadlock and blockage control problem of an automated manufacturing system (AMS) with a single unreliable resource. It aims to develop a robust control policy to ensure that AMS can produce all parts in the absence of resource failures, and when the unreliable resource fails, the system can continuously produce all parts that do not require the failed resource. To this end, we divide the system into two regions, continuous and non-continuous, based on whether all parts in them can be produced continuously or not. For the non-continuous region, dominating region constraints are established to ensure that all parts in it do not block the production of parts in the continuous region, and an optimal deadlock avoidance policy based on a Petri net model is introduced to guarantee its deadlock-free operation. For the continuous region, we configure a resource order policy to ensure the smooth productions of AMS. By integrating the dominating region constraints and deadlock avoidance policy with the configured resource order policy, we propose a novel robust control policy. It is proven to be of polynomial complexity and more permissive than the existing one with the same resource order policy. Also, it is tested to be more permissive than other existing policies. φ(r s )∩φ(r t ) = ∅, ∀r s , r t ∈R F such that s ≠ t.Proof. Suppose that p jk ∈φ(r s )∩φ(r t ) for s ≠ t. Since p jk ∈φ(r s ), for some c ≥ 0, ρ(p j(k+c) ) = r s and p jk ∈φ(p j(k+c) ). Also, for some d ≥ 0, ρ(p j(k+d) ) = r t and p jk ∈φ(p j(k+d) ). Since r s , r t ∈R F , for some e ≥ c, d, ρ(p j(k+e) ) = r u . Without loss of generality, suppose that 0 ≤ c < d ≤ e. p jk ∈φ(p j(k+d) ) implies that ∀v∈[k, k + d), ρ(p jv )∉R F . This is a contradiction, since (k + c)∈[k, k + d) and ρ(p j(k+c) ) = r s ∈R F . ■We can easily prove the following properties. Property 3. Movements of parts within a dominating set do not violate Δ 1 . Property 4. Movements of parts out of N f do not violate Δ 1 . Theorem 5. Let S be an AMS, (N, M 0 ) be its buffer net, and (N f , M f 0 ) = (P f ∪R F , T f , F f , M f 0 ) be its FBS. Given M∈R(N, M 0 , Δ 1 ), let M f = ϒ (M) and ς(M) = {t | t ∈T f , M f [t>M f1 ∈R(N f , M f 0 , ς)}. If λ = 1 and ∀p∉P F , M(p) = 0, then ς(M) ≠ ∅and ∀t∈ς(M), t ∈ D M ð Þ = {t | t ∈T f , M[t>M 1 ∈R(N, M 0 , D)}. Proof. By Theorems 2 and 4, ς is a DAP for (N f , M f 0 ), and thus ς(M) ≠ ∅. Suppose that ∃t∈ς(M) but t ∉D(M). We consider two cases a) t is not enabled at M in N and b) firing t at M violates D. Case a) t is not enabled at M in N. Since M f [t>M f1 , M f ( (a) t) > 0. Since M f =ϒ (M), M(p) = M f (p) holds for p ∈P f . Hence, M( (a) t) > 0. Thus, t is not resource-enabled at M in N, that is, M(r 1 ) = 0, where r 1 = (r) t in N. If r 1 ∈R F and (r 1 , t)∈N f , then M(r 1 ) > 0 since M f (r 1 ) > 0 (M f [t>)and by Lemma 1, M(r 1 ) ≥ M f (r 1 ). Thus r 1 ∈R F and (r 1 , t) ∉N f . In this situation, firing t means moving a part within a dominating set. According to Property 3, M f1 (φ(r 1 )) = M f (φ(r 1 )). Since M∈R(N, M 0 , Δ ...

show abstract

Robust deadlock control for automated manufacturing systems with an unreliable resource

Cited by 46 publications

References 28 publications

Single Controller-Based Colored Petri Nets for Deadlock Control in Automated Manufacturing Systems

Single Controller-Based Colored Petri Nets for Deadlock Control in Automated Manufacturing Systems

Robust deadlock avoidance for sequential resource allocation systems with resource outages

Deadlock and Blockage Control of Automated Manufacturing Systems with an Unreliable Resource

Contact Info

Product

Resources

About