A lower bound for the coverability problem in acyclic pushdown VAS

A lower bound for the coverability problem in acyclic pushdown VAS

We investigate the coverability problem for a one-dimensional restriction of pushdown vector addition systems with states. We improve the lower complexity bound to PSpace, even in the acyclic case. •We investigate the coverability problem for a one-dimensional restriction of pushdown vector addition...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2021-04, Vol.167, p.106079, Article 106079
Hauptverfasser: Englert, Matthias, Hofman, Piotr, Lasota, Sławomir, Lazić, Ranko, Leroux, Jérôme, Straszyński, Juliusz
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Context-free grammars
Coverability problem
One-counter machines
Pushdown vector addition systems
Theory of computation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We investigate the coverability problem for a one-dimensional restriction of pushdown vector addition systems with states. We improve the lower complexity bound to PSpace, even in the acyclic case. •We investigate the coverability problem for a one-dimensional restriction of pushdown vector addition systems with state.•We improve the lower complexity bound of the problem to PSPACE.•The construction is surprisingly simple and works even in the acyclic case.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2020.106079