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 a + bn(i) rather than symbol omega 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.
No takes yet. Share an insight, caveat, or question.
Ding et al. (2008) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: