On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension - Archive ouverte HAL
Communication Dans Un Congrès Année : 2015

On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension

Résumé

Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions involving recursive programs with integer parameters. In particular, it is equivalent to the coverability problem for VAS that operate on a pushdown stack. We show decidability in dimension one, based on an analysis of a new model called grammar-controlled vector addition systems.

Dates et versions

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

Identifiants

Citer

Jérôme Leroux, Grégoire Sutre, Patrick Totzke. On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension. ICALP 2015 - 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.324-336, ⟨10.1007/978-3-662-47666-6_26⟩. ⟨hal-02391883⟩

Collections

CNRS
28 Consultations
0 Téléchargements

Altmetric

Partager

More