Some useful sufficient criteria for the basic reachability problem in general Petri nets

Reachability problem is one of big issues in Petri net theory and practice. However, a useful criterion for Petri nets without any restriction has not been obtained except for some subclasses. In this paper, a new approach to the basic reachability problem with the known firing count vector is given by decomposition method, in which unifying all the causes for spurious solutions to the marking compensation property for every maximal-strongly-connected siphon and trap subnet N _ω with a positive integer firing count vector ω>0, some useful sufficient criteria for reachability are shown for general Petri nets