Comments on "A modified reachability tree approach to analysis of unbounded Petri nets"

被引:16
作者
Ru, Yu
Wu, Weitnin
Hadjicostis, Christoforos N.
机构
[1] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[3] Zhejiang Univ, Natl Lab Ind Control Technol, Hangzhou 310027, Peoples R China
[4] Zhejiang Univ, Inst Adv Proc Control, Hangzhou 310027, Peoples R China
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS | 2006年 / 36卷 / 05期
关键词
Petri nets; reachability tree;
D O I
10.1109/TSMCB.2006.876811
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The above paper introduced the construction of a modified reachability tree (MRT) for (unbounded) Petri nets and its application to reachability, liveness, and deadlock analysis. This note shows via a counterexample that some of the MRT properties claimed in the above paper are incorrect.
引用
收藏
页码:1210 / 1210
页数:1
相关论文
共 2 条
[1]  
Karp R., 1969, J COMPUT SYST SCI, V3, P147, DOI DOI 10.1016/S0022-0000(69)80011-5
[2]   A modified reachability tree approach to analysis of unbounded Petri nets [J].
Wang, FY ;
Gao, YQ ;
Zhou, MC .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2004, 34 (01) :303-308