2000 character limit reached
Reachability in 3-VASS is in Tower (2306.05710v2)
Published 9 Jun 2023 in cs.FL and cs.LO
Abstract: The reachability problem for vector addition systems with states (VASS) has been shown to be \textsc{Ackermann}-complete. For every $k\geq 3$, a completeness result for the $k$-dimensional VASS reachability problem is not yet available. It is shown in this paper that the $3$-dimensional VASS reachability problem is in \textsc{Tower}, improving upon the current best upper bound $\mathbf{F}_7$ established by Leroux and Schmidt in 2019.