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.
翻译:我们提出一种方法来提升塔的复杂程度,降低Petrii 网的可达性问题下限,以便与阿克曼人上界的可达性匹配,解决一个长期存在的开放问题。 我们还证明,第17维的可达性问题不是最基本的问题。