A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On Boundedness Problems for Pushdown Vector Addition Systems
[chapter]
2015
Lecture Notes in Computer Science
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability set for this model can be refined into two decision problems that ask if infinitely many counter values or stack configurations are reachable, respectively. Counter boundedness seems to be the more intricate problem. We show decidability in exponential time for one-dimensional systems. The proof is via a small witness
doi:10.1007/978-3-319-24537-9_10
fatcat:7yfqimz4hjhovfrpowwlhlvhlq