Conformance checking is a growing discipline that aims at assisting organizations in monitoring their processes. On its core, conformance checking relies on the computation of particular artefacts which enable reasoning on the relation between observed and modeled behavior. It is widely acknowledge that the computation of these artifacts is the lion’s share of conformance checking techniques. This paper shows how important conformance artefacts like alignments, anti-alignments or multi-alignments, defined over the Levenshtein edit distance, can be efficiently computed by encoding the problem as an optimized SAT instance. From a general perspective, the work advocates for a unified family of techniques that can compute conformance artefacts in the same way. The implementation of the techniques presented in this paper show capabilities for dealing with both synthetic and real-life instances, which may open the door for a fresh way of applying conformance checking in the near future.

中文翻译：

---

一致性检查人工制品的优化 SAT 编码

一致性检查是一门不断发展的学科，旨在帮助组织监控其流程。就其核心而言，一致性检查依赖于特定人工制品的计算，这些人工制品能够对观察到的行为和建模的行为之间的关系进行推理。人们普遍承认，这些工件的计算是一致性检查技术的最大份额。本文展示了如何通过将问题编码为优化的 SAT 实例来有效地计算在 Levenshtein 编辑距离上定义的重要一致性人工制品，如对齐、反对齐或多对齐。从一般的角度来看，这项工作提倡能够以相同的方式计算一致性人工制品的统一技术系列。