Liveness for synchronized choice Petri nets

被引：11

作者：

Chao, DY

Nicdao, JA

机构：

[1] Natl Chengchi Univ, Dept Management & Informat Sci, Taipei 11623, Taiwan

[2] Inst Informat Ind, Taipei, Taiwan

来源：

COMPUTER JOURNAL | 2001年 / 44卷 / 02期

关键词：

D O I：

10.1093/comjnl/44.2.124

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Unlike traditional classification by output conditions of places, synchronized choice nets were defined as a new class of nets characterized by local structures. This paper investigates its liveness. The time required to examine local structures is less than that required to examine global structures (via structure objects). Thus polynomial time algorithms can be developed to verify the liveness property of Petri nets.

引用

页码：124 / 136

页数：13

共 15 条

[1]

[Anonymous], 1972, THESIS MIT CAMBRIDGE

[2]

Barkaoui K, 1995, LECT NOTES COMPUT SC, V935, P25

[3]

CHAO BT, 1994, INT J HEAT MASS TRAN, V37, P1

[4] 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

[5]

Chao DY, 1998, J INF SCI ENG, V14, P409

[6]

CHAO DY, 1999, 1999 INT FED AUT CON, P193

[7] DEPENDENCY ANALYSIS - A PETRI-NET BASED TECHNIQUE FOR SYNTHESIZING LARGE CONCURRENT SYSTEMS [J].

CHEN, YG ;

TSAI, WT ;

CHAO, D .

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (04) :414-426

[8]

ESPARZA J, 1991, LECT NOTES COMPUTER, V524, P210

[9] 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

[10]

Lautenbach K., 1993, LECT NOTES COMPUTER, V815, P358

← 1 2 →