Handles and reachability analysis of free choice nets

被引：0
|
作者：
Lee, DI [1 ]
Kumagai, S [1 ]
Kodama, S [1 ]
机构：
[1] OSAKA UNIV,DEPT ELECT ENGN,SUITA,OSAKA 565,JAPAN
来源：
APPLICATION AND THEORY OF PETRI NETS 1995 | 1995年 / 935卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we discuss on the reachability analysis of free choice nets based on structure theory associated to handles. First half of the paper is devoted to clarify the relationship between handles and deadlocks/traps from the aspect emphasized on the reachability analysis, In the second half of the paper, the reachability criteria for free choice nets is discussed based on the structure theory. The reachability rendition is expressed in terms of token distribution at the initial or end marking in an appropriately reduced net associated token-free deadlocks or traps. On reachability points of view, classes of Petri nets discussed in the paper involve several important classes of Petri nets as its special cases. The result is extended to extended free choice nets.
引用
收藏
页码：298 / 315
页数：18
相关论文
共 50 条
  • [41] Extremal Throughputs in Free-Choice Nets
    Anne Bouillard
    Bruno Gaujal
    Jean Mairesse
    [J]. Discrete Event Dynamic Systems, 2006, 16 : 327 - 352
  • [42] On persistent reachability in Petri nets
    Barylska, Kamila
    Mikulski, Lukasz
    Ochmanski, Edward
    [J]. INFORMATION AND COMPUTATION, 2013, 223 : 67 - 77
  • [43] On reachability graphs of Petri nets
    Ye, XM
    Zhou, HT
    Song, XY
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 2003, 29 (02) : 263 - 272
  • [44] The reachability problem for object nets
    Koehler, Michael
    [J]. FUNDAMENTA INFORMATICAE, 2007, 79 (3-4) : 401 - 413
  • [45] Compositional reachability in petri nets
    Rathke, Julian
    Sobociński, Pawell
    Stephens, Owen
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8762 : 230 - 243
  • [46] Reachability analysis of logic Petri nets using incidence matrix
    Du, Yu Yue
    Ning, Yu Hui
    Qi, Liang
    [J]. ENTERPRISE INFORMATION SYSTEMS, 2014, 8 (06) : 630 - 647
  • [47] Property analysis of logic Petri nets by marking reachability graphs
    Du, Yuyue
    Ning, Yuhui
    [J]. FRONTIERS OF COMPUTER SCIENCE, 2014, 8 (04) : 684 - 692
  • [48] Control policy for a subclass of Petri nets without reachability analysis
    Liu, GaiYun
    Chao, DanielYuh
    Yu, Fang
    [J]. IET CONTROL THEORY AND APPLICATIONS, 2013, 7 (08): : 1131 - 1141
  • [49] Reachability analysis of (timed) Petri nets using real arithmetic
    Bérard, B
    Fribourg, L
    [J]. CONCUR'99: CONCURRENCY THEORY, 1999, 1664 : 178 - 193
  • [50] Property analysis of logic Petri nets by marking reachability graphs
    Yuyue Du
    Yuhui Ning
    [J]. Frontiers of Computer Science, 2014, 8 : 684 - 692
12345