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 条
  • [1] AN EFFICIENT POLYNOMIAL-TIME ALGORITHM TO DECIDE LIVENESS AND BOUNDEDNESS OF FREE-CHOICE NETS
    KEMPER, P
    BAUSE, F
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 263 - 278
  • [2] A polynomial algorithm to decide the liveness for a class of Petri nets
    Li, Zhiwu
    Liu, Ding
    Wang, Anrong
    PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 254 - 259
  • [3] A polynomial complexity algorithm to decide the liveness for a class of Petri nets
    Li, ZW
    Liu, D
    2005 INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), VOLS 1 AND 2, 2005, : 1175 - 1180
  • [4] A POLYNOMIAL-TIME ALGORITHM TO DECIDE LIVENESS OF BOUNDED FREE CHOICE NETS
    ESPARZA, J
    SILVA, M
    THEORETICAL COMPUTER SCIENCE, 1992, 102 (01) : 185 - 205
  • [5] A POLYNOMIAL-TIME GRAPH ALGORITHM TO DECIDE LIVENESS OF SOME BASIC CLASSES OF BOUNDED PETRI NETS
    BARKAOUI, K
    MINOUX, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 62 - 75
  • [6] On liveness and boundedness of asymmetric choice nets
    Jiao, L
    Cheung, TY
    Lu, WM
    THEORETICAL COMPUTER SCIENCE, 2004, 311 (1-3) : 165 - 197
  • [7] On Compositionality of Boundedness and Liveness for Nested Petri Nets
    Dworzanski, Leonid W.
    Lomazova, Irina A.
    FUNDAMENTA INFORMATICAE, 2012, 120 (3-4) : 275 - 293
  • [8] Liveness and boundedness of decomposable asymmetric choice nets
    Xu, Jing
    Lu, Wei-Ming
    Ruan Jian Xue Bao/Journal of Software, 2002, 13 (11): : 2142 - 2148
  • [9] Liveness and boundedness of extended strong asymmetric choice nets
    Jiao, Li
    Lu, Wei-Ming
    Ruan Jian Xue Bao/Journal of Software, 2001, 12 (09): : 1312 - 1317
  • [10] Controller design to enforce boundedness, liveness and reversibility in Petri nets
    Aybar, A
    Iftar, A
    INTELLIGENT MANUFACTURING SYSTEMS 2003, 2003, : 181 - 186
12345