Premium
Deadlock Control for a Class of Generalized Petri Nets Based on Proper Resource Allocation
Author(s) -
Hou YiFan,
Zhao Mi,
Liu Ding
Publication year - 2016
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.1004
Subject(s) - petri net , liveness , deadlock prevention algorithms , supervisor , deadlock , computer science , distributed computing , flexible manufacturing system , resource allocation , class (philosophy) , set (abstract data type) , state (computer science) , control (management) , mathematical optimization , simple (philosophy) , mathematics , algorithm , computer network , artificial intelligence , philosophy , epistemology , political science , scheduling (production processes) , law , programming language
This article develops a deadlock prevention policy for a class of generalized Petri nets, namely G ‐systems, which can model flexible manufacturing systems with machining, assembly, and disassembly operations. In this research, a polynomial complexity control policy for non‐blocking supervisors is established by properly adjusting resource allocation. First, a set of linear inequality constraints is derived with respect to different resource requirements such that the allocation of the system resources to various requesting processes can be appropriately restricted, that is, the resulting system has no deadlock state by imposing monitors on operation places. Moreover, an algorithm is proposed to identify the redundant constraints such that structurally simple liveness‐enforcing net supervisors can be obtained. Compared with existing polices, the proposed method can usually lead to a suboptimal supervisor with high computational efficiency. Finally, a flexible manufacturing system example is utilized to demonstrate the proposed method.