English

Reachability in Geometrically $d$-Dimensional VASS

Computational Complexity 2025-04-18 v1 Formal Languages and Automata Theory Logic in Computer Science

Abstract

Reachability of vector addition systems with states (VASS) is Ackermann complete~\cite{leroux2021reachability,czerwinski2021reachability}. For dd-dimensional VASS reachability it is known that the problem is NP-complete~\cite{HaaseKreutzerOuaknineWorrell2009} when d=1d=1, PSPACE-complete~\cite{BlondinFinkelGoellerHaaseMcKenzie2015} when d=2d=2, and in Fd\mathbf{F}_d~\cite{FuYangZheng2024} when d>2d>2. A geometrically dd-dimensional VASS is a DD-dimensional VASS for some DdD\ge d such that the space spanned by the displacements of the circular paths admitted in the DD-dimensional VASS is dd-dimensional. It is proved that the Fd\mathbf{F}_d upper bounds remain valid for the reachability problem in the geometrically dd-dimensional VASSes with d>2d>2.

Cite

@article{arxiv.2504.12302,
  title  = {Reachability in Geometrically $d$-Dimensional VASS},
  author = {Yuxi Fu and Yangluo Zheng and Qizhe Yang},
  journal= {arXiv preprint arXiv:2504.12302},
  year   = {2025}
}

Comments

30 pages, 6 figures

R2 v1 2026-06-28T23:00:53.954Z