The Reachability Problem for Petri Nets is Not Primitive Recursive
share
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.
READ FULL TEXT