BVAS reachability is decidable because non-reachability is always witnessed by a semilinear inductive invariant, yielding a simple enumerative algorithm.
Title resolution pending
1 Pith paper cite this work, alongside 7 external citations. Polarity classification is still indexing.
1
Pith paper citing it
7
external citations · OpenAlex
fields
cs.LO 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Solving the Reachability Problem for Branching Vector Addition Systems via Semilinear Inductive Invariants
BVAS reachability is decidable because non-reachability is always witnessed by a semilinear inductive invariant, yielding a simple enumerative algorithm.