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 条
  • [1] A POLYNOMIAL-TIME ALGORITHM TO DECIDE LIVENESS OF BOUNDED FREE CHOICE NETS
    ESPARZA, J
    SILVA, M
    THEORETICAL COMPUTER SCIENCE, 1992, 102 (01) : 185 - 205
  • [2] Polynomial algorithm to decide liveness and boundedness of ESAC nets
    Jiao, Li
    Lu, Wei-Ming
    Ruan Jian Xue Bao/Journal of Software, 2002, 13 (07): : 1257 - 1263
  • [3] 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
  • [4] A polynomial-time algorithm for checking consistency of free-choice signal transition graphs
    Esparza, J
    FUNDAMENTA INFORMATICAE, 2004, 62 (02) : 197 - 220
  • [5] A polynomial-time algorithm for checking consistency of free-choice signal transition graphs
    Esparza, J
    THIRD INTERNATIONAL CONFERENCE ON APPLICATION OF CONCURRENCY TO SYSTEM DESIGN, PROCEEDINGS, 2003, : 61 - 70
  • [6] Efficient Algorithm for Liveness/Safeness Analysis of Free-Choice Nets in A Petri Net Tool: HiPS
    Ide, Kazuto
    Wasaki, Katsumi
    2012 6TH INTERNATIONAL CONFERENCE ON NEW TRENDS IN INFORMATION SCIENCE, SERVICE SCIENCE AND DATA MINING (ISSDM2012), 2012, : 179 - 184
  • [7] 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
  • [8] 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
  • [9] A Polynomial Time Flow for Implementing Free-Choice Petri-Nets
    Mattheakis, Pavlos M.
    Sotiriou, Christos P.
    Beerel, Peter A.
    2012 IEEE 30TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD), 2012, : 227 - 234
  • [10] On liveness and boundedness of asymmetric choice nets
    Jiao, L
    Cheung, TY
    Lu, WM
    THEORETICAL COMPUTER SCIENCE, 2004, 311 (1-3) : 165 - 197
12345