On Boundedness Problems for Pushdown Vector Addition Systems - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

On Boundedness Problems for Pushdown Vector Addition Systems

Résumé

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.

Dates et versions

hal-02391887 , version 1 (03-12-2019)

Identifiants

Citer

Jérôme Leroux, Grégoire Sutre, Patrick Totzke. On Boundedness Problems for Pushdown Vector Addition Systems. RP 2015 - 9th International Workshop on Reachability Problems, Sep 2015, Varsovie, Poland. pp.101-113, ⟨10.1007/978-3-319-24537-9_10⟩. ⟨hal-02391887⟩

Collections

CNRS
41 Consultations
0 Téléchargements

Altmetric

Partager

More