| 摘要: |
| 寻找实际可行的多项式算法一直是Petri网应用的重要方面.给出了关于扩展强化非对称选择网(extended strong asymmetric choice nets,简称ESAC网)结构活和结构有界的一个判定算法.该算法可简单、有效地测试结构活结构有界的ESAC网的初始标识是否是活标识.ESAC网覆盖了自由选择网,因此,该算法应用范围较为广泛. |
| 关键词: 扩展强化非对称选择网(ESAC网) 结构活 结构有界 多项式算法 |
| DOI： |
| 分类号: |
| 基金项目:国家自然科学基金资助项目(60073013);国家重点基础研究发展规划973资助项目(G1998030416) |
|
| A Polynomial Algorithm to Decide Liveness and Boundedness of ESAC Nets |
|
JIAO Li,LU Wei-ming
|
| Abstract: |
| It has been an important direction of Petri net applications to find practical and efficient polynomial algorithms. In this paper, 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. |
| Key words: ESAC nets structural liveness structural boundedness polynomial algorithm |
