A lower bound for the coverability problem in acyclic pushdown VAS

Matthias Englert (1) , Piotr Hofman (2) , Sławomir Lasota (2) , Ranko Lazić (1) , Jérôme Leroux (3) , Juliusz Straszyński (2)

1 Department of Computer Science [Warwick]
2 MIMUW - Faculty of Mathematics, Informatics, and Mechanics [Warsaw]
3 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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.

Mots clés: context-free grammars; pushdown vector addition systems; one-counter machines; coverability problem; reachability problem

Domaines: Informatique [cs]

Matthias Englert, Piotr Hofman, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, et al.. A lower bound for the coverability problem in acyclic pushdown VAS. Information Processing Letters, 2021, 167, pp.106079. ⟨10.1016/j.ipl.2020.106079⟩. ⟨hal-03447041⟩