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 条
  • [21] A survey of reachability trees of unbounded Petri nets
    Gan, Meng-Di
    Wang, Shou-Guang
    Zhou, Meng-Chu
    Li, Jun
    Li, Yue
    Zidonghua Xuebao/Acta Automatica Sinica, 2015, 41 (04): : 686 - 693
  • [22] Reduction Method for Reachability Analysis of Petri Nets
    韩赞东
    李基范
    Tsinghua Science and Technology, 2003, (02) : 231 - 235
  • [23] REACHABILITY TREES FOR PETRI NETS - A HEURISTIC APPROACH
    UMA, G
    PRASAD, BE
    KNOWLEDGE-BASED SYSTEMS, 1993, 6 (03) : 174 - 177
  • [24] Hybrid Petri nets and analysis of its reachability
    Li, Huifeng
    Zhou, Rui
    Chen, Zongji
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2000, 26 (02): : 149 - 152
  • [25] Reachability graph for autonomous continuous Petri nets
    David, R
    Alla, H
    POSITIVE SYSTEMS, PROCEEDINGS, 2003, 294 : 63 - 70
  • [26] Hierarchical Reachability Graph Generation for Petri Nets
    Peter Buchholz
    Peter Kemper
    Formal Methods in System Design, 2002, 21 : 281 - 315
  • [27] Forward reachability analysis of timed Petri nets
    Abdulla, PA
    Deneux, J
    Mahata, P
    Nylén, A
    FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 343 - 362
  • [28] REACHABILITY ANALYSIS OF PETRI NETS USING SYMMETRIES
    STARKE, PH
    SYSTEMS ANALYSIS MODELLING SIMULATION, 1991, 8 (4-5): : 293 - 303
  • [29] Solving the reachability problem of a class of Petri nets
    Jeng, MD
    Peng, MY
    ETFA '97 - 1997 IEEE 6TH INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION PROCEEDINGS, 1997, : 258 - 262
  • [30] Hierarchical reachability graph generation for Petri nets
    Buchholz, P
    Kemper, P
    FORMAL METHODS IN SYSTEM DESIGN, 2002, 21 (03) : 281 - 315