强Sleptsov网是图灵完备的
Strong Sleptsov Net is Turing-Complete
AI总结:
本研究提出强Sleptsov网(单步内触发最大多重度变迁的Sleptsov网变体),通过模拟Shepherdson与Sturgis寄存器机证明其图灵完备性,为该并发编程图形语言的应用提供理论支撑。
摘要:
众所周知,Sleptsov网(斯列普佐夫网)允许在一个步骤内多次触发变迁,其运行速度比Petri网(佩特里网)快指数级,这为它作为并发编程图形语言的应用开辟了前景。我们基于可触发规则对库所-变迁网进行分类,考虑了通用定义及其强、弱变体。我们提出并研究了强Sleptsov网——在一个步骤中具有最大触发多重度的变迁会被触发,并证明它是图灵完备的。我们沿用Peterson用于证明抑制弧Petri网图灵完备性的证明模式,模拟了Shepherdson与Sturgis寄存器机。我们证明的核心构造是一个用于检查寄存器值(库所标记)是否等于零的强Sleptsov网。
英文摘要:
It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for its application as a graphical language of concurrent programming. We provide classification of place-transition nets based on firability rules considering general definitions and their strong and weak variants. We introduce and study a strong Sleptsov net, where a transition with the maximal firing multiplicity fires at a step, and prove that it is Turing-complete. We follow the proof pattern of Peterson applied to prove that an inhibitor Petri net is Turing-complete simulating a Shepherdson and Sturgis register machine. The central construct of our proof is a strong Sleptsov net that checks whether a register value (place marking) equals zero.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。