论文标题
真正的并发可能很容易
True Concurrency Can Be Easy
论文作者
论文摘要
步进净分配是有限的培养皿网的共同诱导行为关系，这是对有限的petri网络上标准步骤双拟合\ cite {nt84}定义的平滑概括。它的诱导等效性提供了一种替代性的，更简单的表征，即因果关系\ cite {g15，gor22}，因为它不诉诸于任何因果关系结构，并且是结构上具有结构性的bisimarlity \ cite \ cite {g15}，因为它不需要在相关标记之间进行表现力映射。我们表明，可以通过合适的模态逻辑（NET模态逻辑的首字母缩写）以逻辑表征步进净二比度：当它们满足相同的NML公式时，两个标记是步进的net Bisiminar。
Step net bisimulation is a coinductive behavioral relation for finite Petri nets, which is a smooth generalization of the definition of standard step bisimulation \cite{NT84} on finite Petri nets. Its induced equivalence offers an alternative, much simpler characterization of causal-net bisimilarity \cite{G15,Gor22}, as it does not resort to any causality structure, and of structure-preserving bisimilarity \cite{G15}, as it does not require bijective mappings between related markings. We show that step net bisimilarity can be characterized logically by means of a suitable modal logic, called NML (acronym of net modal logic): two markings are step net bisimilar if and only if they satisfy the same NML formulae.
