加载中…
2015-10-28
Structurally Cyclic Petri Nets
Drewes FrankLeroux Jérôme
文献摘要
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju’s approach for the general reachability problem for Petri nets.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本