Polynomial algorithm to decide liveness and boundedness of ESAC nets

被引：0
|
作者：
Jiao, Li [1 ]
Lu, Wei-Ming [1 ]
机构：
[1] Inst. of Math., Acad. of Math. and Syst. Sci., Chinese Acad. of Sci., Beijing 100080, China
来源：
Ruan Jian Xue Bao/Journal of Software | 2002年 / 13卷 / 07期
关键词：
Algorithms - Polynomials - Theorem proving;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
It has an important direction of Petri net applications to find practical and efficient polynomial algorithms. An algorithm is given to decide the structural liveness and structural boundedness of extended strong asymmetric choice (ESAC) nets. This algorithm can also decide whether an initial marking of a structurally live and structurally bounded ESAC net is a live marking or not. Since the class of ESAC nets contains free choice (FC) nets, this algorithm shows large area of applications.
引用
收藏
页码：1257 / 1263
相关论文
共 50 条
  • [21] Polynomial time decidability of monotone liveness of time bounded AC/DC nets
    Ohta, A
    Tsuji, K
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2001, E84A (11) : 2865 - 2870
  • [22] Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed Petri nets
    Abdulla, P
    Mahata, P
    Mayr, R
    FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 2004, 3328 : 58 - 70
  • [23] Identification of controllable transitions to decide the existence of an optimal liveness-enforcing supervisor for a class of Petri nets
    Li, Zhiwu
    Qin, Meng
    Zhu, Sen
    TRANSACTIONS OF THE INSTITUTE OF MEASUREMENT AND CONTROL, 2011, 33 (3-4) : 406 - 421
  • [24] Polynomial fairness and liveness
    Backes, M
    Pfitzmann, B
    Steiner, M
    Waidner, M
    15TH IEEE COMPUTER SECURITY FOUNDATION WORKSHOP, PROCEEDINGS, 2002, : 160 - 174
  • [25] Macro liveness graph and liveness of ω-independent unbounded nets
    Wang ShouGuang
    Gan MengDi
    Zhou MengChu
    SCIENCE CHINA-INFORMATION SCIENCES, 2015, 58 (03) : 1 - 10
  • [26] Macro liveness graph and liveness of ω-independent unbounded nets
    WANG ShouGuang
    GAN MengDi
    ZHOU MengChu
    ScienceChina(InformationSciences), 2015, 58 (03) : 132 - 141
  • [27] A POLYNOMIAL-TIME ALGORITHM TO DECIDE PAIRWISE CONCURRENCY OF TRANSITIONS FOR 1-BOUNDED CONFLICT-FREE PETRI NETS
    YEN, HC
    INFORMATION PROCESSING LETTERS, 1991, 38 (02) : 71 - 76
  • [28] Liveness of Safe Object Nets
    Koehler-Bussmeier, Michael
    Heitmann, Frank
    FUNDAMENTA INFORMATICAE, 2011, 112 (01) : 73 - 87
  • [29] Observable liveness of Petri nets
    Desel, Joerg
    Kilinc, Goerkem
    ACTA INFORMATICA, 2015, 52 (2-3) : 153 - 174
  • [30] A polynomial algorithm for checking diagnosability of Petri nets
    Wen, YL
    Li, CH
    Jeng, M
    INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOL 1-4, PROCEEDINGS, 2005, : 2542 - 2547
12345