Searching strict minimal siphons for SNC-based resource allocation systems

被引:0
作者
Chao, Daniel Yuh [1 ]
机构
[1] Natl Chengchi Univ, Dept Management & Informat Sci, Taipei 116, Taiwan
关键词
petri nets; siphons; traps; FMS; algorithm; liveness; deadlock;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
For a flexible manufacturing system (FMS) or Resource Allocation System (RAS) which can be decomposed into a number of synchronized choice nets interconnected by resource places, we propose to efficiently extract strict minimal siphons (SMS) in an incremental fashion rather than the traditional global approach. Only a subset of all SMS needs to be searched. The rest SMS can be found by adding and deleting common sets of places from existing ones.
引用
收藏
页码:853 / 867
页数:15
相关论文
共 17 条
[1]  
BARKAOUI K, 1995, IEEE S EM TECHN FACT, V2, P499
[2]   GENERATING BASIS SIPHONS AND TRAPS OF PETRI NETS USING THE SIGN INCIDENCE MATRIX [J].
BOER, ER ;
MURATA, T .
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS, 1994, 41 (04) :266-271
[3]  
Chao DY, 2007, J INF SCI ENG, V23, P203
[4]  
Chao DY, 2006, COMPUT J, V49, P470, DOI 10.1093/comjnl/bx1019
[5]   Two theoretical and practical aspects of knitting technique: Invariants and a new class of Petri net [J].
Chao, DY ;
Wang, DT .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1997, 27 (06) :962-977
[6]   Liveness for synchronized choice Petri nets [J].
Chao, DY ;
Nicdao, JA .
COMPUTER JOURNAL, 2001, 44 (02) :124-136
[7]   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
[8]  
CORMEN TH, 1992, INTRO ALGORITHMS
[9]  
Ezpeleta FTJ, 2003, ETFA 2003: IEEE CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION, VOL 1, PROCEEDINGS, P322
[10]   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