The geometry of reachability in continuous vector addition systems with states

Open Webpage

Shaull Almagor, Arka Ghosh, Tim Leys, Guillermo A. Pérez

Published: 01 Jan 2025, Last Modified: 22 Jul 2025Inf. Comput. 2025EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We introduce the geometric representation of reachability sets for continuous VASS.•An alternative proof for complexity bounds on the reachability problem for them.•A practical algorithm for the same problem over rationals or positive rationals.•Even if acyclic, with zero tests, the problem is harder than for counter automata.•Although, for acylic continuous 1-VASS with zero tests, it is in PTIME.