Petri网可达性的综合判定法

Analysis for Reachability Problem of Petri Net

Petri网标识的可达性判定问题是进行Petri网分析的基础,而传统的判定方法并不能确保所得结果的可靠性.在揭示Petri网可达性问题的实质之后,讨论了在标识图的同一连通域内标识可达性的判定问题,进而在分析相关原理的基础上提出了一种有效判定Petri网标识可达性的综合判定法.此判定方法综合多种传统判定方法的优点,结合Gr鯾ner基理论,确保了对Petri网标识可达性进行判定所得结果的可靠性.

The marking's reachability problem is one of the basis problems in Petri net analysis. As the conventional methods for solving it may not insure the exactitude of the outcome, the essential of the reachability problem is pointed out. Besides, the different connected areas are plotted out and the reachability of markings in the same connected areas of marking graph is discussed. Finally, an effective method for solving the marking's reachability problem is presented as the conclusion of the whole work, which can be used for ordinary nets. This method preserves the virtues of the conventional methods, takes the advantage of the Grobner basis algorithm, and can insure the exactitude of the outcome.