| 满秩Petri网可达性判定算法的设计与实现 |
| |
| 引用本文： | 李文敬.满秩Petri网可达性判定算法的设计与实现[J].广西师院学报,2009(3):88-92. |
| |
| 作者姓名： | 李文敬 |
| |
| 作者单位： | 广西师范学院计算机与信息工程学院,广西南宁530001 |
| |
| 摘 要： | 通过对Petri网可达性的分析，给出满秩Petrl网可达性算法及其实现过程，在VC＋＋平台上对算法进行验算，并对算法运行结果进行可达性讨论；该算法为满秩Petri网可达性的判定提供了一种快速有效的求解方法．
|
| 关 键 词： | 满秩 Petri网 可达性判定 算法设计 标识集 |
Algorithm Design of Full Rank Petri Net Reachability Judge and Its Implementation |
| |
| LI Wen-jing.Algorithm Design of Full Rank Petri Net Reachability Judge and Its Implementation[J].Journal of Guangxi Teachers College(Natural Science Edition),2009(3):88-92. |
| |
| Authors: | LI Wen-jing |
| |
| Institution: | LI Wen-jing (College of Computer and Information Engineering, Guangxi Teachers Education University, Nanning 530001, China) |
| |
| Abstract: | The paper analyzes the reachability problem of Petri net. Its full rank reachability algorithm and realization is given. Verifying the algorithm on VC ＋ ＋ platform, the question of reachability based on the results of algorithm runn up. The algorithm provides a quick and effective solution for reachability judge full rank of Petri net. |
| |
| Keywords: | full rank Petri net reachability judge algorithm design marking set |
| 本文献已被 维普 等数据库收录！ |
