Petri网性能等价的不可判定性
Undecidability of performance equivalence of Petri nets
摘要:
研究了持续语义下Petri网的互模拟等价性。我们的动机是验证猜想,即在持续时间设置中,互模拟等价性检查问题变得比普通设置更容易处理(情况就是这样,例如,在无通信网络上)。我们反驳这一猜想在三个四个持续语义的变体。第四种变体仍然是一个有趣的开放问题。
英文摘要:
We investigate bisimulation equivalence on Petri nets under durational semantics. Our motivation was to verify the conjecture that in durational setting, the bisimulation equivalence checking problem becomes more tractable than in ordinary setting (which is the case, e.g., over communication-free nets). We disprove this conjecture in three of four proposed variants of durational semantics. The fourth variant remains an intriguing open problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。