2 papers
cs.FL2026
3-VASS Reachability is in EXPSPACE
Weijun Chen, Bo Fu, Yuxi Fu +4
A VASS can be viewed as a finite-state automaton manipulating a fixed number (called its dimension) of counters holding non-negative values. The reachability problem, asking whethe…
cs.LO2026
On the Reachability Problem for One-Dimensional Thin Grammar Vector Addition Systems
Chengfeng Xue, Yuxi Fu
Vector addition systems with states (VASS) are a classic model in concurrency theory. Grammar vector addition systems (GVAS), equivalently, pushdown VASS, extend VASS by using a co…