A Sufficient Condition for Reachability in a General Petri Net

被引：0
|
作者：
Parthasarathy Ramachandran
Manjunath Kamath
机构：
[1] Indian Institute of Technology Kanpur,Department of Industrial and Management Engineering
[2] Oklahoma State University,School of Industrial Engineering and Management
来源：
Discrete Event Dynamic Systems | 2004年 / 14卷
关键词：
Petri nets; reachability analysis; acyclic transformations; unfolding; net expansion; transition firing sequence;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Necessary and sufficient conditions for reachability exist only for special classes of Petri nets, acyclic Petri nets being one among them. We present a net transformation procedure that converts a general Petri net into an acyclic Petri net to utilize the available sufficient condition. We show the relationship between the reachable markings of the original Petri net and the associated acyclic Petri net. Given a firing count vector, we discuss how the sufficient condition for reachability in an acyclic Petri net could be utilized for a general Petri net. We also discuss the utility of the acyclic transformed net in determining the transition firing sequences of the reachable markings with known firing count vectors.
引用
收藏
页码：251 / 266
页数：15
相关论文
共 50 条
  • [1] A sufficient condition for reachability in a general Petri net
    Ramachandran, P
    Kamath, M
    DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2004, 14 (03): : 251 - 266
  • [2] AN ALGORITHM FOR THE GENERAL PETRI NET REACHABILITY PROBLEM
    MAYR, EW
    SIAM JOURNAL ON COMPUTING, 1984, 13 (03) : 441 - 460
  • [3] A primitive recursive algorithm for the general Petri net reachability problem
    Bouziane, Z
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 130 - 136
  • [4] Some useful sufficient criteria for the basic reachability problem in general Petri nets
    Matsumoto, T
    Miyano, Y
    Jiang, YZ
    PROCEEDINGS OF THE 36TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-5, 1997, : 4104 - 4109
  • [5] DECIDABILITY OF THE PETRI NET REACHABILITY PROBLEM
    BUDINAS, BL
    AUTOMATION AND REMOTE CONTROL, 1988, 49 (11) : 1393 - 1422
  • [6] A USEFUL NECESSARY CONDITION AND A SIMPLE SUFFICIENT CONDITION FOR LIVENESS OF GENERAL PETRI NETS
    MATSUMOTO, T
    TSUJI, K
    IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS, 1991, 74 (10): : 3124 - 3132
  • [7] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, MengChu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [8] Lean Reachability Tree for Petri Net Analysis
    Li, Jun
    Yu, Xiaolong
    Zhou, Mengchu
    2016 IEEE 13TH INTERNATIONAL CONFERENCE ON NETWORKING, SENSING, AND CONTROL (ICNSC), 2016,
  • [9] Petri Net Synthesis from a Reachability Set
    Best, Eike
    Devillers, Raymond
    APPLICATION AND THEORY OF PETRI NETS AND CONCURRENCY, PETRI NETS 2024, 2024, 14628 : 223 - 243
  • [10] On reachability in autonomous continuous Petri net systems
    Júlvez, J
    Recalde, L
    Silva, M
    APPLICATIONS AND THEORY OF PETRI NETS 2003, PROCEEDINGS, 2003, 2679 : 221 - 240
12345