关于历史确定性单计数器网
On History-Deterministic One-Counter Nets
AI总结:
本文研究历史确定性单计数器网(OCN)的可判定性与语言性质,通过将单令牌博弈归约为模拟博弈证明历史确定性可判定,并构造等价确定性自动机。
摘要:
我们考虑历史确定性单计数器网(OCN)的模型。历史确定性是转移系统的一种性质,允许有限形式的非确定性,这种非确定性可以“即时”解决。令牌博弈曾用于刻画多种模型上的历史确定性,同样也刻画了OCN上的历史确定性。通过将单令牌博弈归约为模拟博弈,我们能够证明检查OCN的历史确定性是可判定的。此外,我们证明对于转移的一元编码该问题是PSPACE完全的,对于二元编码则是EXPSPACE完全的。然后我们研究历史确定性OCN的语言性质。我们证明历史确定性OCN的非确定性解析器最终是周期的。因此,对于给定的历史确定性OCN,我们构造一个语言等价的确定性单计数器自动机。我们还证明了比较历史确定性OCN的语言(如语言包含和语言普遍性)的可判定性。
英文摘要:
We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have been used to characterise history-determinism over various models, also characterise history-determinism over OCNs. By reducing 1-token games to simulation games, we are able to show that checking for history-determinism of OCNs is decidable. Moreover, we prove that this problem is PSPACE-complete for a unary encoding of transitions, and EXPSPACE-complete for a binary encoding. We then study the language properties of history-deterministic OCNs. We show that the resolvers of non-determinism for history-deterministic OCNs are eventually periodic. As a consequence, for a given history-deterministic OCN, we construct a language equivalent deterministic one-counter automaton. We also show the decidability of comparing languages of history-deterministic OCNs, such as language inclusion and language universality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。