In this paper, we decrease the information losing during unbounded Petri nets running by finding an improvement of reachability tree, and finally propose an algorithm for reachability decision of any Petri nets including unbounded Petri nets by making use of its improved reachability tree.
本文通过寻求一个可达性树的适当改良而令无界Petri网运行过程中的信息丢失减小,并利用这个改良的可达性树给出一个任意Petri网(包括无界Petri网)的可达性判定方法。
It is well known that deciding reachability of bounded Petri nets with its reachability tree is easy.
众所周知,对于有界Petri网,通过构造其可达性树或可达标识图来判定其可达性是容易的。
英语网 · 高考英语
英语网 · 双语新闻
英语网 · 双语娱乐资讯
英语网 · 英语词汇