PARALLEL AND SEQUENTIAL MUTUAL EXCLUSIONS FOR PETRI NET MODELING OF MANUFACTURING SYSTEMS WITH SHARED RESOURCES

被引:201
作者
ZHOU, MC
DICESARE, F
机构
[1] RENSSELAER POLYTECH INST,DEPT ELECT COMP & SYST ENGN,TROY,NY 12180
[2] RENSSELAER POLYTECH INST,CTR MFG PROD & TECHNOL TRANSFER,TROY,NY 12180
[3] NEW JERSEY INST TECHNOL,MFG ENGN PROGRAM,NEWARK,NJ 07102
[4] NEW JERSEY INST TECHNOL,CTR MFG SYST,NEWARK,NJ 07102
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1991年 / 7卷 / 04期
关键词
D O I
10.1109/70.86081
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The design of Petri net models is the first step for control, validation, performance analysis, and simulation using Petri nets for automated manufacturing systems. These systems share many resources such as robots, machines, and material movers. Previous modeling methods need to be extended to guarantee the desired properties of the Petri nets for general cases where possible deadlocks result from inappropriate initial markings or net structures for systems with shared resources. Boundedness, liveness, and reversibility are the properties necessary to control practical manufacturing systems and are important in order to conduct system performance analysis. The research reported provides a theoretical basis for Petri net synthesis methods that can be used to model systems with shared resources, and to make the resulting nets bounded, live, and reversible. Two resource-sharing concepts, parallel mutual exclusion (PME) and sequential mutual exclusion (SME), are formulated in the context of Petri net theory. A PME models a resource shared by distinct independent processes, and an SME is a sequential composition of PME's, modeling a resource shared by sequentially related processes. Then the conditions under which a net containing such structures remains bounded, live, and reversible are derived. Future work will extend PME and SME to more general cases.
引用
收藏
页码:515 / 527
页数:13
相关论文
共 37 条
[1]  
Agerwala T., 1978, Proceedings of the Fifteenth Annual Design Automation Conference, P305
[2]  
AGERWALA T, 1979, COMPUTER, V12, P85, DOI 10.1109/MC.1979.1658580
[3]  
AHUJA JS, 1988, MAY P INT C COMP INT, P350
[4]  
ALJAARAND RY, 1991, IN PRESS ADV AUTOMAT, V2
[5]  
Berge C., 1962, THEORY GRAPHS
[6]  
BERTHELOT G, 1985, ADV PETRI NETS 1985, P19
[7]  
COURVOISIER M, 1983, P IECON, P174
[8]  
CROCKETT D, 1987, 1987 P IEEE INT C RO, P1861
[9]   SYNTHESIS OF A CLASS OF DEADLOCK-FREE PETRI NETS [J].
DATTA, A ;
GHOSH, S .
JOURNAL OF THE ACM, 1984, 31 (03) :486-506
[10]  
DATTA A, 1986, F SOFTWARE TECHNOLOG, V241, P288