arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.00476cs.LO
收藏

单计数器网的模拟问题

Simulation Problems Over One-Counter Nets

Piotr Hofman, Slawomir Lasota, Richard Mayr, Patrick Totzke

摘要:

单计数器网络(OCN)是一种有限自动机,配备了一个计数器,可以存储非负整数值,并且不能测试为零。等价地,这些是具有状态的1维向量加法系统。我们证明了OCN上的强模拟预序和弱模拟预序都是PSPACE完备的。

英文摘要:

One-counter nets (OCN) are finite automata equipped with a counter that can store non-negative integer values, and that cannot be tested for zero. Equivalently, these are exactly 1-dimensional vector addition systems with states. We show that both strong and weak simulation preorder on OCN are PSPACE-complete.

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

↑