摘要
通过对Petri网可达性的分析,给出满秩Petri网可达性算法及其实现过程,在VC++平台上对算法进行验算,并对算法运行结果进行可达性讨论;该算法为满秩Petri网可达性的判定提供了一种快速有效的求解方法.
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.
出处
《广西师范学院学报（自然科学版）》
2009年第3期88-92,112,共6页
Journal of Guangxi Teachers Education University(Natural Science Edition)
