TY - JOUR
T1 - A Hybrid Methodology for Synthesis of Petri Net Models for Manufacturing Systems
AU - Zhou, Meng Chu
AU - DiCesare, Frank
AU - Desrochers, Alan A.
N1 - Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.
PY - 1992/6
Y1 - 1992/6
N2 - This paper presents a hybrid methodology for systematic synthesis of Petri net models for automated manufacturing systems. Beginning with a bounded (safe), live, or reversible Petri net as a first-level net model for a system, we synthesize Petri nets by first refining operation places through basic design modules in top-down modular ways, then adding nonshared resource places stepwise, and finally adding shared resource places step by step in a bottom-up manner. Refinement theory is extended to include reversibility of Petri nets. Parallel and sequential mutual exclusions are used to model shared resources. Design of the first-level Petri nets is discussed and two basic kinds of Petri nets, choice-free and choice-synchronization, are given to cope with different types of manufacturing systems. The major advantages of the method are that the modeling details can be introduced in incremental ways such that complexity can be handled, and the important properties of the resulting Petri net are guaranteed so that costly mathematical analysis for boundedness, liveness, and reversibility can be avoided. These properties are necessary to control practical manufacturing systems and important in order to conduct system performance analysis. A manufacturing system consisting of four machines, one assembly cell, two shared robots, and two buffers is used to illustrate the design methodology.
AB - This paper presents a hybrid methodology for systematic synthesis of Petri net models for automated manufacturing systems. Beginning with a bounded (safe), live, or reversible Petri net as a first-level net model for a system, we synthesize Petri nets by first refining operation places through basic design modules in top-down modular ways, then adding nonshared resource places stepwise, and finally adding shared resource places step by step in a bottom-up manner. Refinement theory is extended to include reversibility of Petri nets. Parallel and sequential mutual exclusions are used to model shared resources. Design of the first-level Petri nets is discussed and two basic kinds of Petri nets, choice-free and choice-synchronization, are given to cope with different types of manufacturing systems. The major advantages of the method are that the modeling details can be introduced in incremental ways such that complexity can be handled, and the important properties of the resulting Petri net are guaranteed so that costly mathematical analysis for boundedness, liveness, and reversibility can be avoided. These properties are necessary to control practical manufacturing systems and important in order to conduct system performance analysis. A manufacturing system consisting of four machines, one assembly cell, two shared robots, and two buffers is used to illustrate the design methodology.
UR - http://www.scopus.com/inward/record.url?scp=0026882077&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026882077&partnerID=8YFLogxK
U2 - 10.1109/70.143353
DO - 10.1109/70.143353
M3 - Article
AN - SCOPUS:0026882077
SN - 1042-296X
VL - 8
SP - 350
EP - 361
JO - IEEE Transactions on Robotics and Automation
JF - IEEE Transactions on Robotics and Automation
IS - 3
ER -