The Operations and Properties of Reproducibility of the Empty Marking

Computational Intelligence and Security, 2008. CIS '08. International Conference(2008)

引用 0|浏览0
暂无评分
摘要
Kurt Lautenbach presented sufficient and necessary conditions for reproducibility of the empty marking and proved that the empty marking is reproducible if and only if there is non-negative T-invariant, whose net representations have neither siphons nor traps, containing a positive entry for at least one fact and goal transition. This paper extends these results, we prove that composition, insertion, deletion and substitution do not influence reproducibility of the empty marking, and a net with reproducibility of the empty marking preserves the reproducibility in its backward net (N is a net, its backward net N-1 arises from N by reversing the direction of all arcs). We also show that the empty marking in acyclic P/T nets with a positive entry for at least one fact and goal transition is reproducible if and only if the net is covered by T-invariant.
更多
查看译文
关键词
non-negative t-invariant,positive entry,necessary condition,goal transition,kurt lautenbach,empty marking,acyclic p,chromium,nickel,petri net,petri nets,reproducibility,operations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要