Reachability criterion for Petri nets with known firing count vectors

被引:0
|
作者
Matsumoto, T [1 ]
Miyano, Y [1 ]
机构
[1] Univ Fukui, Fac Engn, Fukui 9108507, Japan
关键词
general Petri nets; reachability; state equation; spurious solutions; net decomposition; immature siphons/traps;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A formal necessary and sufficient condition on the general Petri net reachability problem is presented by eliminating all spurious solutions among known nonnegative integer solutions of state equation and unifying all the causes of those spurious solutions into a maximal-strongly-connected and siphon-and-trap subnet N-w. This result is based on the decomposition of a given net (N, M-o) with M-d and the concepts of "no immature siphon at the reduced initial marking M-wo" and "no immature trap at the reduced end marking M-wd" on N-w which are both extended from "no token-free siphon at the initial marking M-o" and "no token-free trap at the end marking M-d" on N, respectively, which have been both effectively, explicitly or implicitly, used in the well-known fundamental and simple subclasses.
引用
收藏
页码:628 / 634
页数:7
相关论文
共 50 条
  • [1] Generalized submarking reachability problems under unknown firing count vectors and their inverse problems of Petri nets
    Matsumoto, T
    APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 476 - 479
  • [2] Reachability criterion of live free choice Petri nets
    Matsumoto, T
    APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96, 1996, : 350 - 353
  • [3] Reachability and firing sequences of homogeneous synchronized choice Petri nets
    Chao, DY
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2005, 21 (01) : 129 - 152
  • [4] On persistent reachability in Petri nets
    Barylska, Kamila
    Mikulski, Lukasz
    Ochmanski, Edward
    INFORMATION AND COMPUTATION, 2013, 223 : 67 - 77
  • [5] On reachability graphs of Petri nets
    Ye, XM
    Zhou, HT
    Song, XY
    COMPUTERS & ELECTRICAL ENGINEERING, 2003, 29 (02) : 263 - 272
  • [6] Compositional reachability in petri nets
    Rathke, Julian
    Sobociński, Pawell
    Stephens, Owen
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8762 : 230 - 243
  • [7] Algorithm for the set of generators of an arbitrary firing count vector in Petri nets
    Takata, M
    Matsumoto, T
    Moro, S
    SICE 2002: PROCEEDINGS OF THE 41ST SICE ANNUAL CONFERENCE, VOLS 1-5, 2002, : 847 - 852
  • [8] A reachability graph construction algorithm based on canonical transition firing count vectors
    Chiola, G
    Carvajal-Schiaffino, R
    9TH INTERNATIONAL WORKSHOP ON PETRI NETS AND PERFORMANCE MODELS, PROCEEDINGS, 2001, : 113 - 122
  • [9] The Reachability Problem for Petri Nets Is Not Elementary
    Czerwinski, Wojciech
    Lasota, Slawomir
    Lazic, Ranko
    Leroux, Jerome
    Mazowiecki, Filip
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 24 - 33
  • [10] On Achieving Reachability Paths of Petri nets
    Ozkan, Hanife Apaydin
    2015 9TH INTERNATIONAL CONFERENCE ON ELECTRICAL AND ELECTRONICS ENGINEERING (ELECO), 2015, : 724 - 728