一般场所/变迁系统中无冲突的抽象过程
Abstract Processes in the Absence of Conflicts in General Place/Transition Systems
摘要:
Goltz和Reisig将Petri网的一个安全Petri网的过程概念推广到了一般的网,其中位置携带多个令牌。BD-过程是Goltz-Reisig过程的等价类,它们通过Best和Devillers的交换变换连接起来;它们可以被认为是网络运行的另一种表示。在这里,我们提出了一个顺序尊重BD-过程和FS-过程的可数网之间的双射,后者被定义-在一个类似的方式-作为等价类的射击序列。利用这一点,我们表明,一个可数网没有二元冲突有一个(唯一的)最大的BD过程。
英文摘要:
Goltz and Reisig generalised Petri's concept of processes of one-safe Petri nets to general nets where places carry multiple tokens. BD-processes are equivalence classes of Goltz-Reisig processes connected through the swapping transformation of Best and Devillers; they can be considered as an alternative representation of runs of nets. Here we present an order respecting bijection between the BD-processes and the FS-processes of a countable net, the latter being defined -- in an analogous way -- as equivalence classes of firing sequences. Using this, we show that a countable net without binary conflicts has a (unique) largest BD-process.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。