On Boundedness Problems for Pushdown Vector Addition Systems

Jérôme Leroux, Grégoire Sutre, Patrick Totzke

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationReachability Problems
Subtitle of host publication9th International Workshop, RP 2015, Warsaw, Poland, September 21-23, 2015, Proceedings
PublisherSpringer International Publishing
Number of pages13
ISBN (Electronic)978-3-319-24537-9
ISBN (Print)978-3-319-24536-2
Publication statusPublished - 2015

Publication series

NameLecture Notes in Computer Science
PublisherSpringer International Publishing
ISSN (Print)0302-9743


Dive into the research topics of 'On Boundedness Problems for Pushdown Vector Addition Systems'. Together they form a unique fingerprint.

Cite this