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 条
  • [41] Timing and liveness in continuous Petri nets
    Renato Vazquez, C.
    Silva, Manuel
    AUTOMATICA, 2011, 47 (02) : 283 - 290
  • [42] Liveness, fairness, and recurrence in Petri nets
    Kindler, E
    van der Aalst, W
    INFORMATION PROCESSING LETTERS, 1999, 70 (06) : 269 - 274
  • [43] On liveness and safeness of asymmetric choice nets
    Inst of Mathematics, Chinese Acad of Sciences, Beijing, China
    Ruan Jian Xue Bao/Journal of Software, 2000, 11 (05): : 590 - 605
  • [44] Liveness Enforcement for Time Petri Nets*
    Qin, Tao
    Dong, Yifan
    Yin, Li
    Wu, Naiqi
    Li, Zhiwu
    2022 8TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT'22), 2022, : 1184 - 1189
  • [45] A Reduction Method of Analyzing Data-Liveness and Data-Boundedness for a Class of E-commerce Business Process Nets
    Yu, Wangyang
    Liu, Guanjun
    He, Leifeng
    SECURITY, PRIVACY, AND ANONYMITY IN COMPUTATION, COMMUNICATION, AND STORAGE, 2016, 10066 : 70 - 83
  • [46] Boundedness of adaptive nets is decidable
    Oanea, Olivia
    INFORMATION PROCESSING LETTERS, 2011, 111 (15) : 738 - 743
  • [47] A Polynomial Algorithm for Computing Elementary Siphons in a Class of Petri Nets
    Liu, Huixia
    Xing, Keyi
    Wang, Feng
    Han, Libin
    Sun, Xiaojing
    ASIAN JOURNAL OF CONTROL, 2012, 14 (04) : 1141 - 1149
  • [48] A Polynomial Time Algorithm That Learns Two Hidden Unit Nets
    Baum, Eric B.
    NEURAL COMPUTATION, 1990, 2 (04) : 510 - 522
  • [49] Boundedness undecidability for synchronized nets
    Devillers, Raymond
    Van Begin, Laurent
    INFORMATION PROCESSING LETTERS, 2006, 99 (05) : 208 - 214
  • [50] Place Bisimulation and Liveness for Open Petri Nets
    Dong, Xiaoju
    Fu, Yuxi
    Varacca, Daniele
    DEPENDABLE SOFTWARE ENGINEERING: THEORIES, TOOLS, AND APPLICATIONS, 2016, 9984 : 1 - 17
12345