arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.07069cs.FL
收藏

具有重置的一维下推向量加法系统的覆盖性是不可判定的

Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets

Sylvain Schmitz, Georg Zetzsche

摘要:

考虑具有重置的下推向量加法系统模型。这些由向量加法系统组成,可以访问下推堆栈并具有重置计数器的指令。对于这个模型,我们研究了可覆盖性问题。在没有重置的情况下,这个问题已知对于一维下推向量加法系统是可判定的,但是对于一般的下推向量加法系统,可判定性是开放的。此外,覆盖性已知是可判定的复位向量加法系统没有下推堆栈。本文证明了带重置的一维下推向量加法系统的问题是不可判定的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑