| 判定非对称选择网活性及活性单调性的一个算法 |
| |
| 引用本文： | 宋文,陆维明.判定非对称选择网活性及活性单调性的一个算法[J].计算机科学,2005,32(9):18-20. |
| |
| 作者姓名： | 宋文 陆维明 |
| |
| 作者单位： | 1. 中国科学院数学与系统科学研究院,北京,100080;西华大学计算机与数理学院,成都,610039
2. 中国科学院数学与系统科学研究院,北京,100080 |
| |
| 基金项目： | 本课题得到国家自然科学基金（60073013）,国家重点基础研究专项经费（G1998030416）和中国科学院决策与信息系统实验室（MADIS）资助,四川省科技厅应用基础课题（03226125）. |
| |
| 摘 要： | 活性是Petri网的重要行为特征之一.为了得到判定AC网活性有效的算法,本文利用分治的思想,在定义极小死锁的前、后归约子网的基础上,将较大问题分而治之,把未知问题转化为已知的FC网上的问题,从而得到了判定AC网活性及活性单调性的多项式时间的算法.
|
| 关 键 词： | 非对称选择网 活性 活性单调性 Petri网 分析算法 |
An Algorithm to Decide Liveness and Liveness Monotonicity of Asymmetric Choice Nets |
| |
| SONG Wen,LU Wei-Ming.An Algorithm to Decide Liveness and Liveness Monotonicity of Asymmetric Choice Nets[J].Computer Science,2005,32(9):18-20. |
| |
| Authors: | SONG Wen LU Wei-Ming |
| |
| Affiliation: | SONG Wen,LU Wei-Ming(1. Institude of Mathematics, Mathematics and System Science Academy, The Chinese Academy of Science, Beijing 100080;2.School of Computers |
| |
| Abstract: | Liveness is one of the important behavioral properties of Petri nets. The aim of this contribution is to draw a more powerful algorithm to decide liveness of asymmetric choice nets (AC). Firstly, this paper presents difinitions of Pre-induced subnet and Post-induced subnet of the minimal siphon. And then the idea of Divide and Conquer is intro- duced to transform the targeted problems into the counterpart of FC(free choice nets). Finally, a polymial-time algo- rithm to decide liveness and liveness monotonicity of AC is presented. |
| |
| Keywords: | Asymmetric choice net Liveness Liveness monotonicity Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
