利用改进可达树检查一库所无界Petri网的死锁

Realization of the Deadlock Checking for One-Place Unbounded Petri Nets Based on Modified Reachability Trees

Petri网的可达树是一个基础的强有力的分析方法和工具,它可以用来分析各种性能,包括活性、有界性、保持性、可达性和可覆盖性。本文主要利用改进可达树对Petri网的活性和可达性进行分析研究,并基于改进可达树的算法实现对一库所无界Petri网进行死锁检测。

The reachability tree of a Petri net is a fundamental and powerful one for various properties including liveness, boundedness, conservation, reachability, and coverability. This paper analyzes the liveness and reachability of a Petri net, and realizes the deadlock checking for one-place unbounded Petri Nets based on the modified reachability trees.