The Reachability Problem for Petri Nets is Not Primitive Recursive
Abstract
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 Fd-hard. As a direct corollary, the reachability problem in dimension 10 is not elementary.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.