The paper presents a novel approach for discovering Petri nets (PN) that include silent transitions from logs of event sequences. We propose a repairing method that extends existing discovery techniques that do not deal with silent transitions; such techniques may yield substructures that involve deadlocks. Such substructures, called inconsistent (IS), are detected through a structural pattern. IS are rewritten by adding new transitions labelled with event symbols already assigned to transitions in IS; the rewritten model has no deadlocks. Afterwards, the PN with duplicated event labels is transformed into an equivalent model with silent transitions. The algorithms derived from the technique, which have polynomial-time complexity, have been implemented and tested on examples of diverse structures.

本文提出了一种发现 Petri 网 (PN) 的新方法，其中包括来自事件序列日志的静默转换。我们提出了一种修复方法，该方法扩展了不处理静默转换的现有发现技术；这种技术可能会产生涉及死锁的子结构。这种称为不一致 (IS) 的子结构是通过结构模式检测的。IS 通过添加新的过渡来重写，这些新过渡标有已分配给 IS 中的过渡的事件符号；重写的模型没有死锁。之后，具有重复事件标签的 PN 被转换为具有静默转换的等效模型。从该技术派生的算法具有多项式时间复杂度，已在不同结构的示例上实现和测试。