Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets

DOI10.1007/978-3-030-30806-3_15OpenAlexW2971887426MaRDI QIDQ2330602

Georg Zetzsche, Sylvain Schmitz

Publication date: 22 October 2019

Full work available at URL: https://arxiv.org/abs/1906.07069

zbMATH Keywords

decidabilitypushdown vector addition systems

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A lower bound for the coverability problem in acyclic pushdown VAS

This page was built for publication: Coverability Is undecidable in one-dimensional pushdown vector addition systems with resets