Conformance checking is a key process mining task for comparing the expected behavior captured in a process model and the actual behavior recorded in a log. While this problem has been extensively studied for pure control-flow processes, conformance checking with multi-perspective processes is still at its infancy. In this paper, we attack this challenging problem by considering processes that combine the data and control-flow dimensions. In particular, we adopt data Petri nets (DPNs) as the underlying reference formalism, and show how solid, well-established automated reasoning techniques can be effectively employed for computing conformance metrics and data-aware alignments. We do so by introducing the CoCoMoT (Computing Conformance Modulo Theories) framework, with a fourfold contribution. First, we show how SAT-based encodings studied in the pure control-flow setting can be lifted to our data-aware case, using SMT as the underlying formal and algorithmic framework. Second, we introduce a novel preprocessing technique based on a notion of property-preserving clustering, to speed up the computation of conformance checking outputs. Third, we provide a proof-of-concept implementation that uses a state-of-the-art SMT solver and report on preliminary experiments. Finally, we discuss how CoCoMoT directly lends itself to a number of further tasks, like multi- and anti-alignments, log analysis by clustering, and model repair.
翻译:兼容性检查是比较一个过程模型所捕捉到的预期行为和日志所记录的实际行为的关键进程采矿任务。 虽然这个问题已经为纯控制流程过程进行了广泛研究, 但与多视角过程的一致检查仍处于初级阶段。 在本文件中,我们通过考虑将数据和控制流程各维结合起来的过程来应对这个具有挑战性的问题。 特别是, 我们采用数据Petrii net(DPNs)作为基本参考形式主义的基础, 并展示如何有效地使用可靠、 完善的自动推理技术来计算符合性指标和数据匹配。 我们这样做的办法是采用CoCoMOT(Mopulo Modulo Theories)框架, 并作出四倍的贡献。 首先, 我们展示了如何将纯控制流程环境中所研究的基于SAT的编码解脱给我们的数据认知性案例, 使用SMT(SMT)作为基本的正式和算法格式框架。 其次, 我们采用了基于财产保留组合概念的新型前处理技术, 以加速计算符合性检查产出的计算。 第三, 我们提供了一种基于SMT(S-MIT) 和M(S-C) 初步) 分析, 我们如何使用一个校正(S-C-C-C-C-C-C-C-C-C-C-C-C-C-S-C-S-BD-S-S-S-S-S-S-S-S-S-S-S-S-S-B-B-S-S-S-S-S-S-S-S-S-S-S-S-C-C-S-S-B-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-A-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S