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

Sleptsov网是图灵完备的

Sleptsov Nets are Turing-complete

Bernard Berthomieu, Dmitry A. Zaitsev

AI总结:

该研究通过简洁构造证明Sleptsov网(SN)具有图灵完备性,改进了此前仅强Sleptsov网具备该性质的结论,明确了SN与Petri网的触发规则差异及强SN的非确定性限制。

摘要:

本文证明了Sleptsov网(SN)具有图灵完备性,通过简洁的构造大幅改进了此前强Sleptsov网(强SN)具有图灵完备性的结论。需要说明的是,与Petri网不同,SN始终以最大触发多重度单步触发所有使能的变迁,仅对可触发变迁的选择保留非确定性。强SN则将非确定性选择限制为仅触发具有最高触发多重度的变迁。

英文摘要:

The present paper proves that a Sleptsov net (SN) is Turing-complete, that considerably improves, with a brief construct, the previous result that a strong SN is Turing-complete. Remind that, unlike Petri nets, an SN always fires enabled transitions at their maximal firing multiplicity, as a single step, leaving for a nondeterministic choice of which fireable transitions to fire. A strong SN restricts nondeterministic choice to firing only the transitions having the highest firing multiplicity.

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

↑