Process nets with resources for manufacturing modeling and their analysis

被引:77
作者
Jeng, M [1 ]
Xie, XL
Peng, MY
机构
[1] Natl Taiwan Ocean Univ, Dept Elect Engn, Chilung 202, Taiwan
[2] ENIM, INRIA, MACSI Team, F-57045 Metz, France
[3] HannStar Display Corp, CIM Dept, Tao Yuan 326, Taiwan
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 2002年 / 18卷 / 06期
关键词
deadlocks; liveness; reversibility; shared-resource systems; siphons and traps;
D O I
10.1109/TRA.2002.805655
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 [计算机科学与技术];
摘要
This paper presents a new class of Petri nets called process nets with resources (PNRs) for modeling manufacturing systems where only parts can interact with resources, and resources alone cannot interact with one another. PNRs properly include S-3 PR, augmented marked graphs, and some subclasses of RCN merged nets and ERCN merged nets. As a result, PNRs can model far more complex manufacturing process flows and resource sharing than these nets. To construct a PNR, we first build a process net to specify the process flow for each part type. A process net is a consistent, conservative, strongly connected, and live Petri net that satisfies three conditions, including strong reversibility. Then resource places denoting the availability of resource types are added to the process nets. We generalize strong reversibility for PNRs in order to check a sufficient condition for reversibility of PNRs. It is shown that strong reversibility and reversibility of a PNR depends on the siphons. Liveness of a PNR can be verified by checking the potential firability of all transitions of each isolated process net, which is, informally speaking, a process net with all resources allocated to it. A manufacturing example is given to show the applicability of PNRs.
引用
收藏
页码:875 / 889
页数:15
相关论文
共 24 条
[1]
Agerwala T., 1978, Proceedings of the Fifteenth Annual Design Automation Conference, P305
[2]
BERTHELOT G, 1985, ADV PETRI NETS 1985, P19
[3]
ERGODICITY AND THROUGHPUT BOUNDS OF PETRI NETS WITH UNIQUE CONSISTENT FIRING COUNT VECTOR [J].
CAMPOS, J ;
CHIOLA, G ;
SILVA, M .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1991, 17 (02) :117-125
[4]
Deadlock analysis of Petri nets using siphons and mathematical programming [J].
Chu, F ;
Xie, XL .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1997, 13 (06) :793-804
[5]
A POLYNOMIAL-TIME ALGORITHM TO DECIDE LIVENESS OF BOUNDED FREE CHOICE NETS [J].
ESPARZA, J ;
SILVA, M .
THEORETICAL COMPUTER SCIENCE, 1992, 102 (01) :185-205
[6]
A PETRI-NET BASED DEADLOCK PREVENTION POLICY FOR FLEXIBLE MANUFACTURING SYSTEMS [J].
EZPELETA, J ;
COLOM, JM ;
MARTINEZ, J .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1995, 11 (02) :173-184
[7]
JENG MD, 1995, IEEE T ROBOTIC AUTOM, V11, P317, DOI 10.1109/70.388774
[8]
Analysis of modularly composed nets by siphons [J].
Jeng, MD ;
Xie, XL .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 1999, 29 (04) :399-406
[9]
KOH I, 1991, IEEE T SYST MAN CYB, V21, P963
[10]
KROGH BH, 1986, P 4 IFAC IFORS S LAR, P661