论文标题
全麦培养皿网和过程
Whole-grain Petri nets and processes
论文作者
论文摘要
我们提出了基于多项式式有限型配置和etale地图的培养皿网的形式主义。 The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an algebraic semantics in the style of Meseguer and Montanari, in terms of free coloured props, and allows the following unification: for P a Petri net, the Segal space of P-processes is shown to be the free coloured prop-in-groupoids on P. There is also an绕开古典对称问题的语义源：随着新的形式主义，每个培养皿都承认了一个普遍的发展，这反过来又将事件结构和斯科特领域缔合。由于所有内容都用明确的集合编码，因此培养皿及其过程具有元素。尤其是个人语义是本地的。 （集体语义的语义来自最刺激的商结构，最佳删除者涉及驱动状态的π_0。）
We present a formalism for Petri nets based on polynomial-style finite-set configurations and etale maps. The formalism supports both a geometric semantics in the style of Goltz and Reisig (processes are etale maps from graphs) and an algebraic semantics in the style of Meseguer and Montanari, in terms of free coloured props, and allows the following unification: for P a Petri net, the Segal space of P-processes is shown to be the free coloured prop-in-groupoids on P. There is also an unfolding semantics à la Winskel, which bypasses the classical symmetry problems: with the new formalism, every Petri net admits a universal unfolding, which in turn has associated an event structure and a Scott domain. Since everything is encoded with explicit sets, Petri nets and their processes have elements. In particular, individual-token semantics is native. (Collective-token semantics emerges from rather drastic quotient constructions à la Best-Devillers, involving taking π_0 of the groupoids of states.)
