AN EFFICIENT POLYNOMIAL-TIME ALGORITHM TO DECIDE LIVENESS AND BOUNDEDNESS OF FREE-CHOICE NETS

被引：0
|
作者：
KEMPER, P
BAUSE, F
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 616卷
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In [3] J. Esparza presented an interesting characterization of structurally live and structurally bounded Free-Choice Nets (LBFC-Nets). Exploiting this characterization in combination with new results and refined algorithms the authors formulate an O(\P\\T\\F\) algorithm deciding whether a Free-Choice Net is a LBFC-Net or not. Furthermore the algorithm contains a simple and efficient test to ensure that the initial marking of a LBFC-Net is live. This test is based on a simplified characterization of liveness for LBFC-Nets.
引用
收藏
页码：263 / 278
页数：16
相关论文
共 50 条
  • [31] A polynomial-time decomposition algorithm for petri nets based on indexes of transitions
    Zeng Q.
    Information Technology Journal, 2011, 10 (04) : 856 - 862
  • [32] Notes on liveness and boundedness of extended strong asymmetric choice nets II
    Li Jiao
    Weiming Lu
    Journal of Computer Science and Technology, 2001, 16 : 426 - 433
  • [33] Notes on liveness and boundedness of extended Strong Asymmetric Choice Nets II
    Jiao, L
    Lu, WM
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2001, 16 (05) : 426 - 433
  • [34] Free-choice Petri nets - An algebraic approach
    Baccelli, F
    Foss, S
    Gaujal, B
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1996, 41 (12) : 1751 - 1778
  • [35] Free-choice Nets with Home Clusters are Lucent
    van der Aalst, Wil M. P.
    FUNDAMENTA INFORMATICAE, 2021, 181 (04) : 273 - 302
  • [36] On probabilistic diagnosis for free-choice Petri Nets
    Flochova, Jana
    Boel, Rene K.
    Jiroveanu, George
    2007 AMERICAN CONTROL CONFERENCE, VOLS 1-13, 2007, : 5541 - +
  • [37] On Deciding the Existence of a Liveness Enforcing Supervisory Policy in a Class of Partially Controlled General Free-Choice Petri Nets
    Somnath, N.
    Sreenivas, R. S.
    IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2013, 10 (04) : 1157 - 1160
  • [38] Optimal sensor choice for observability in Free-choice Petri Nets
    Aguirre-Salas, L
    Begovich, O
    Ramirez-Treviño, A
    PROCEEDINGS OF THE 2001 IEEE INTERNATIONAL SYMPOSIUM ON INTELLIGENT CONTROL (ISIC'01), 2001, : 270 - 275
  • [39] DECOMPOSITION ALGORITHMS FOR LIVE AND SAFE FREE-CHOICE NETS
    NISHIMURA, T
    LEE, DI
    KODAMA, S
    KUMAGAI, S
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1995, 78 (01): : 1 - 12
  • [40] A PROOF OF THE RANK THEOREM FOR EXTENDED FREE-CHOICE NETS
    DESEL, J
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 616 : 134 - 153
12345