PVASS Reachability is Decidable
By: Roland Guttenberg, Eren Keskin, Roland Meyer
Potential Business Impact:
Solves a super hard computer puzzle.
Reachability in pushdown vector addition systems with states (PVASS) is among the longest standing open problems in Theoretical Computer Science. We show that the problem is decidable in full generality. Our decision procedure is similar in spirit to the KLMST algorithm for VASS reachability, but works over objects that support an elaborate form of procedure summarization as known from pushdown reachability.
Similar Papers
On the Reachability Problem for Two-Dimensional Branching VASS
Logic in Computer Science
Lets computers check if a process can finish.
Reachability in 3-VASS is Elementary
Formal Languages and Automata Theory
Solves a hard computer puzzle faster.
Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
Formal Languages and Automata Theory
Solves complex computer puzzles faster.