A Primitive Recursive Algorithm for the General Petri Net Reachability Problem
Abstract
The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive.