Two classes of Petri Nets with Reachability Equivalent to State Equation Satisfiability

Reachability is one of the most basic and important dynamic properties of Petri nets. But the reachability decidability problem has at least exponential space complexity and no effective algorithm is found by now. However,there exist some special Petri nets the reachability problem of which is easiliy to be decided. And it has great significance to find such Petri nets subclasses. For this reason,the definitions of minimal-trap-circuit Petri net...