On boundedness problems for pushdown vector addition systems
From MaRDI portal
Abstract: 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 property derived from an analysis of derivation trees of grammar-controlled vector addition systems.
Recommendations
- Hyper-Ackermannian bounds for pushdown vector addition systems
- A multiparameter analysis of the boundedness problem for vector addition systems
- On the coverability problem for pushdown vector addition systems in one dimension
- Reachability of scope-bounded multistack pushdown systems
- Tight bounds for reachability problems on one-counter and pushdown systems
Cited in
(10)- Place-boundedness for vector addition systems with one zero-test
- On functions weakly computable by pushdown Petri nets and related systems
- On the coverability problem for pushdown vector addition systems in one dimension
- A lower bound for the coverability problem in acyclic pushdown VAS
- Hardness results for coverability problem of well-structured pushdown systems
- On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems
- Tight bounds for reachability problems on one-counter and pushdown systems
- Average stack cost of Büchi pushdown automata
- Unboundedness problems for languages of vector addition systems
- Hyper-Ackermannian bounds for pushdown vector addition systems
This page was built for publication: On boundedness problems for pushdown vector addition systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675154)
