The Reachability Problem for Petri Nets is Not Primitive Recursive [article]

Jérôme Leroux
2021 arXiv   pre-print
We provide an Ackermannian complexity lower bound for the reachability problem for checking programs, a model equivalent to Petri nets. Moreover in fixed dimension 2d+4, we show that the problem is 𝔽_d-hard. As a direct corollary, the reachability problem in dimension 10 is not elementary.
arXiv:2104.12695v4 fatcat:sn5wl27frveehn4tpopqnb4eqe