当前位置: X-MOL 学术 › Fundam. Inform. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Stop-transitions of Petri Nets
Fundamenta Informaticae ( IF 1.166 ) Pub Date : 2020-09-28 , DOI: 10.3233/fi-2020-1951
Jörg Desel 1 , Marc Finthammer 1
Affiliation  

A transition t stops a place/transition Petri net if each reachable marking of the net enables only finite occurrence sequences without occurrences of t (i.e., every infinite occurrence sequence enabled at this marking contains occurrences of t). Roughly speaking, when t is stopped then all transitions of the net stop eventually. This contribution shows how to identify stoptransitions of unbounded nets using the coverability graph. Furthermore, the developed technique is adapted to a more general question considering a set of stop-transitions and focussing on a certain part of the net to be stopped. Finally, an implementation of the developed algorithm is presented.

中文翻译:

Petri网的停止转换

如果网络的每个可达标记仅启用了有限的发生序列而没有出现t,则过渡t会停止位置/过渡Petri网(即,在该标记处启用的每个无限出现序列都包含t的出现)。粗略地说,当t停止时,网络的所有跃迁最终都会停止。此贡献显示了如何使用可覆盖性图识别无界网络的停止过渡。此外,考虑到一组停止转换并集中在要停止的网络的特定部分上,所开发的技术适用于更一般的问题。最后,提出了一种改进算法的实现。
更新日期:2020-09-30
down
wechat
bug