Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets

Hu, Hesuan; Su, Rong; Zhou, MengChu; Yang, Liu

doi:10.1109/tcst.2015.2504046

Cited by 46 publications

(24 citation statements)

References 59 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Automata are intuitive models used to achieve the original contributions and most of the subsequent developments in the literature of supervisory control of DESs [20], [50]. Meanwhile, with the development of DESs, Petri nets (PNs) have become a conceptual framework and a fundamental model for DESs since they are widely used to address various classes of problems, including the formal representation and development of systems, along with their supervisory control [9], [10], [17], [49], [55], controller synthesis or design [22], [23], [34], [47], state estimation and observability [2], [14], [36], fault detection, diagnosis, and prognosis [11], [16], [19], [25], [37], [48], [56], [57], diagnosability [3], [8], [40], [41], opacity [12], [13], [46],…”

Section: Introductionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

This paper develops an approach for solving the problem of least-cost transition firing sequences estimation in labeled Petri nets with unobservable transitions. Each transition in the net is labeled as either observable or unobservable, and has a nonnegative cost. Additionally, we assume that the net system is bounded, the unobservable subnet is acyclic, and the cost of each unobservable transition is strictly positive. We propose the method mainly on the basis of the notions of basis marking and basis reachability graph (BRG), which is a compact representation of the reachability graph of the net system. By sacrificing extra storage space to keep the BRG and other necessary information in memory, some time-consuming computations are moved off-line. This makes our proposed approach more feasible for on-line applications. Finally, we present a brief survey and comparison of some representative methods that use labeled Petri nets as a formalism in the literature. INDEX TERMS Basis reachability graph (BRG), discrete event system (DES), Petri net (PN), transition firing sequence.

show abstract

Section: Introductionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…In the past few decades, manufacturing practitioners and academic researchers have obtained a large number of significant results for understanding the control, structural, and computational issues of deadlocks for AMSs [1, 3, 5, 7–9, 14, 16, 19–21]. In most such studies, researchers assume that allocated resources never fail.…”

Section: Introductionmentioning

confidence: 99%

Robust deadlock avoidance control for AMSs with assembly operations embedded in flexible routes using Petri nets

2019

IET Control Theory & Applications

View full text Add to dashboard Cite

“…As a mathematical formalism and graphical tool, a Petri net (PN) has been used for modeling, analyzing, and designing discrete event systems, including AMSs. To cope with deadlocks for AMSs, researchers have presented a variety of control policies [1,5,6,13,16,[18][19][20][24][25][26][27][28][29][30][31][32][33][34][35]. Ezpeleta et al [5] define a class of PNs called system of simple sequential processes with resources (S 3 PR).…”

Section: Introductionmentioning

confidence: 99%

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

Polynomially Complex Synthesis of Distributed Supervisors for Large-Scale AMSs Using Petri Nets

Cited by 46 publications

References 59 publications

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Robust deadlock avoidance control for AMSs with assembly operations embedded in flexible routes using Petri nets

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

Contact Info

Product

Resources

About