nets的用法

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网）的可达性判定方法。

In this paper, a Web Services composition model based on model driven architecture is established. Using Petri Nets for its modeling, and using reachability tree nature of Petri Nets validates the model boundedness, accessibility, activity and integrity.

本文构建了一种基于模型驱动的Web服务组合模型，采用Petri网对其建模，并利用Petri网的可达树性质验证了模型的有界性、可达性、活性和完整性。

By using of the characters of safe Petri nets, a place invariant generation algorithm which uses the reachability tree of safe Petri nets and complete graph of mth order with self-loop is presented.

利用安全Petri网的特点，提出一种由安全Petri网可达树和带自环的m阶完全图来计算位置不变式的生成算法。