The Reachability Problem for Petri Nets is Not Primitive Recursive

We present a way to lift up the Tower complexity lower bound of the reachability problem for Petri nets to match the Ackermannian upper bound closing a long standing open problem. We also prove that the reachability problem in dimension 17 is not elementary.

Authors

• Jérôme Leroux

Keywords

No keywords are indexed for this paper.