Abstract: 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.
汤利杰 卢从慧 郭大江. 利用改进可达树检查一库所无界Petri网的死锁[J]. , 2012, 1(1、2): 0-0.
Tang Lijie Lu Conghui Guo Dajiang. Realization of the Deadlock Checking for One-Place Unbounded Petri Nets Based on Modified Reachability Trees. , 2012, 1(1、2): 0-0.