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 条
12345