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 条
  • [21] Useful necessary and sufficient condition for reachability of extended marked graphs
    Tsuji, K
    ISCAS '98 - PROCEEDINGS OF THE 1998 INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-6, 1998, : B330 - B333
  • [22] Approximating Petri Net Reachability Along Context-free Traces
    Atig, Mohamed Faouzi
    Ganty, Pierre
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 152 - 163
  • [23] Classifications of Petri net transitions and their application to firing sequence and reachability problems
    Huang, JS
    Murata, T
    SMC '97 CONFERENCE PROCEEDINGS - 1997 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-5: CONFERENCE THEME: COMPUTATIONAL CYBERNETICS AND SIMULATION, 1997, : 263 - 268
  • [24] Project and Conquer: Fast Quantifier Elimination for Checking Petri Net Reachability
    Amat, Nicolas
    Dal Zilio, Silvano
    Le Botlan, Didier
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2024, PT I, 2024, 14499 : 101 - 123
  • [25] Parallel computation of the reachability graph of petri net models with semantic information
    de Murillas, Eduardo Gonzalez-Lopez
    Fabra, Javier
    Alvarez, Pedro
    Ezpeleta, Joaquin
    SOFTWARE-PRACTICE & EXPERIENCE, 2017, 47 (05): : 647 - 668
  • [26] A New Approach to Analyze the Reachability of Petri Net and Its Use in Maintenance
    Fang, Hualing
    Dong, Chuandai
    PROCEEDINGS OF 2009 8TH INTERNATIONAL CONFERENCE ON RELIABILITY, MAINTAINABILITY AND SAFETY, VOLS I AND II: HIGHLY RELIABLE, EASY TO MAINTAIN AND READY TO SUPPORT, 2009, : 630 - +
  • [27] A slicing-based approach to enhance Petri net reachability analysis
    Lee, WJ
    Kim, HN
    Cha, SD
    Kwon, YR
    JOURNAL OF RESEARCH AND PRACTICE IN INFORMATION TECHNOLOGY, 2000, 32 (02): : 131 - 143
  • [28] Petri net extended with condition and probability information
    Sun, Chang-Le
    Guo, Dong-Ming
    Gao, Hang
    Zou, Ling-Hao
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2010, 16 (07): : 1444 - 1451
  • [29] An Extended Time Petri Net with Condition Information
    Guo, D. M.
    Sun, C. L.
    Gao, H.
    Zou, L. H.
    ADVANCES IN MATERIALS MANUFACTURING SCIENCE AND TECHNOLOGY XIII, VOL II: MODERN DESIGN THEORY AND METHODOLOGY, MEMS AND NANOTECHNOLOGY, AND MATERIAL SCIENCE AND TECHNOLOGY IN MANUFACTURING, 2009, 628-629 : 1 - 6
  • [30] A reachability algorithm for general Petri nets based on transition invariants
    Kostin, Alexander E.
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2006, PROCEEDINGS, 2006, 4162 : 608 - 621
12345