Step net bisimilarity \cite{Gor23} is a truly concurrent behavioral equivalence for finite Petri nets, which is defined as a smooth generalization of standard step bisimilarity \cite{NT84} on Petri nets, but with the property of relating markings (of the same size only) generating the same partial orders of events. The process algebra FNM \cite{Gor17} truly represents all (and only) the finite Petri nets, up to isomorphism. We prove that step net bisimilarity is a congruence w.r.t. the FMN operators, In this way, we have defined a compositional semantics, fully respecting causality and the branching structure of systems, for the class of all the finite Petri nets.
翻译:纯双轨制 \ cite{Gor23} 是一个真正同时存在的有限Petri 网的行为等同, 被定义为在Petri 网上顺利地将标准步骤的两步制化 \ cite{NT84}, 但其相关标记( 同一大小) 的属性产生相同的部分事件顺序。 进程代数 FNM\ cite{Gor17} 真正代表( 仅代表) 有限的 Petri 网, 直至无形态。 我们证明, 进步净额双轨制是FMN 操作员的一致 。 这样, 我们定义了组成语义, 充分尊重了所有限定的Petri 网类的因果关系和系统分支结构 。