Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets

Résumé

We consider the model of pushdown vector addition systems with resets. These consist of vector addition systems that have access to a pushdown stack and have instructions to reset counters. For this model, we study the coverability problem. In the absence of resets, this problem is known to be decidable for one-dimensional pushdown vector addition systems, but decidability is open for general pushdown vector addition systems. Moreover, coverability is known to be decidable for reset vector addition systems without a pushdown stack. We show in this note that the problem is undecidable for one-dimensional pushdown vector addition systems with resets.

Dates et versions

hal-03440052 , version 1 (22-11-2021)

Identifiants

Citer

Sylvain Schmitz, Georg Zetzsche. Coverability Is Undecidable in One-Dimensional Pushdown Vector Addition Systems with Resets. 13th International Conference on Reachability Problems (RP 2019), 2019, Brussels, Belgium. pp.193--201, ⟨10.1007/978-3-030-30806-3_15⟩. ⟨hal-03440052⟩
8 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More