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

Authors:
ZhiJun Ding;ChangJun Jiang;MengChu Zhou
Affiliations:
Coll. of Inf. Sci. & Eng., Shandong Univ. of Sci. & Technol., Qingdao;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2008

Citing 0
Cited 2

Liveness enforcing supervision of video streaming systems using nonsequential Petri nets

IEEE Transactions on Multimedia
Petri net modeling and deadlock analysis of parallel manufacturing processes with shared-resources

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A deadlock-checking approach for one-place unbounded Petri nets is presented based on modified reachability trees (MRTs). An MRT can provide some useful information that is lost in a finite reachability tree, owing to MRT's use of the expression rather than symbol to represent the value of the components of a marking. The information is helpful to property analysis of unbounded Petri nets. For the deadlock-checking purpose, this correspondence paper classifies full conditional nodes in MRT into two types: true and fake ones. Then, an algorithm is proposed to determine whether a full conditional node is true or not. Finally, a necessary and sufficient condition of deadlocks is presented. Examples are given to illustrate the method.