论文标题
在没有一般地点/过渡系统冲突的情况下抽象过程
Abstract Processes in the Absence of Conflicts in General Place/Transition Systems
论文作者
论文摘要
Goltz和Reisig概括了Petri的一卫培养皿网的过程概念，到了地方带有多个令牌的通用网。 BD过程是通过交换最佳和Devillers连接的Goltz-Reisig过程的等效类别；它们可以被视为网跑的替代表示。在这里，我们提出了一个符合BD-Processes与可数网络的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.
