A Petri Net-Based Discrete-Event Control of Automated Manufacturing Systems With Assembly Operations

Hu, Hesuan; Zhou, MengChu

doi:10.1109/tcst.2014.2342664

Cited by 105 publications

(31 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Zhang et al [15] presented how the short-term scheduling problem of crude oil operations can be described using hybrid Petri nets while in [14], deadlock problems in Petri nets were addressed through the addition of recovery transitions. Hu and Zhou [16] also investigate the subject of deadlock problems within Petri nets for manufacturing applications, concluding that a new Petri net formation could be proposed that identified deadlocks in an iterative fashion within automated manufacturing systems; research in this area has also been carried out by [17]. Finally in [18] the subject of deadlock free scheduling for flexible manufacturing system is explored with future work proposed to extend research to the use of timed Petri nets, a subject explored in more detail by [19].…”

Section: Relevant Literaturementioning

confidence: 99%

Adapting Petri Nets to DES: Stochastic Modelling of Manufacturing Systems

Simon¹,

Oyekan²,

Hutabarat³

et al. 2018

Int. j. simul. model.

View full text Add to dashboard Cite

Discrete-Event Simulation (DES) is commonly used for the simulation of manufacturing systems. In many practical cases, DES practitioners have to make simplifications or to use the software in an unconventional or convoluted fashion to meet their needs. Petri nets enable the development of transparent models which allow increased flexibility and control for designers. Furthermore, Petri nets take advantage of a solid mathematical ground and constitute a simple language. However, Petri nets lack the software capabilities to realise their full potential. This study investigates the suitability and relevance of Discrete-Event Simulation (DES) software for Petri net modelling in the context of manufacturing systems. A framework is developed for the modelling of different classes of Petri nets on DES. Analytical models of asynchronous flow lines are developed. Initial results show that the analytical models are without closed-form solution and the explosion of the state space is observed, justifying the use of computational methods and simulation for the analysis of manufacturing systems. This study shows that the gain in flexibility provided by Petri nets provides a new insight into the effects of stochasticity on setup and failure times in manufacturing systems.

show abstract

Section: Relevant Literaturementioning

confidence: 99%

Adapting Petri Nets to DES: Stochastic Modelling of Manufacturing Systems

Simon¹,

Oyekan²,

Hutabarat³

et al. 2018

Int. j. simul. model.

View full text Add to dashboard Cite

show abstract

“…It is easy to verify that M is reachable under D. The marking of the FBS in Fig. 2 31 . At M f , two instances of W 21 are in the buffer spaces of r 1 and waiting to be processed on r 2 , while two instances of W 31 are in the buffer spaces of r 2 and waiting to be processed on r 1 , a deadlock occurs.…”

Section: Dominating Region Constraintsmentioning

confidence: 99%

“…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%

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

“…The mathematical foundations allow the establishment of a rigorous verification, guarantee a high reliability, and decrease the ambiguities. Petri nets are considered as an excellent tool that can be used to model and analyze discrete event systems [3,5]. Several Petri net extensions have been proposed and implemented including: Colored Petri Nets (CPN) [6,7] Nets Within Nets (NWN) [7,9], Nested Petri Nets (NPN) [10,11] and object petri nets [12].…”

Section: Introductionmentioning

confidence: 99%

Towards a Meta-Modeling and Verification Approach of Multi-Agent Systems Based on the Agent Petri Net Formalism

Dembri¹,

Redjimi²

2019

IJITCS

View full text Add to dashboard Cite

The Agent Petri Nets (APN) formalism provides a set of adapted and specific tools, relations and functions for modeling multi-agent systems (MAS). However, there is a lack of tools for verifying the APN models. In order to fill some of these gaps, we propose in this paper, a meta-modeling approach based on the Model Driven Architecture (MDA). The Eclipse Modeling Framework (EMF) permits to define a generic APN Meta-model in Ecore informal format. Its abstraction level is very high, it offers as a basis for developing system models dedicated to various specific domains. In addition, the Object Constraint Language (OCL) aims to increase the structural verification level of the model and the Graphical Modeling Framework (GMF), for its part, is concerned with generating a graphical editor associated with the APN meta-model. Thus, we combine the rigor of APN formalism with the power of the MDA-based metamodeling tools for verifying APN models.

show abstract

A Petri Net-Based Discrete-Event Control of Automated Manufacturing Systems With Assembly Operations

Cited by 105 publications

References 33 publications

Adapting Petri Nets to DES: Stochastic Modelling of Manufacturing Systems

Adapting Petri Nets to DES: Stochastic Modelling of Manufacturing Systems

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

Towards a Meta-Modeling and Verification Approach of Multi-Agent Systems Based on the Agent Petri Net Formalism

Contact Info

Product

Resources

About