Scalable alignment of process models and event logs: An approach based on automata and S-components
作者:
Highlights:
• The method derives lossless and compact automata of an event log and a process model.
• An A∗ algorithm finds minimal and deterministic alignments between the automata.
• Memoization techniques are used to speed up the computation of alignments.
• A decomposition-based approach divides the process model into S-Components.
• A recomposition technique merges partial results into a final alignment.
摘要
•The method derives lossless and compact automata of an event log and a process model.•An A∗ algorithm finds minimal and deterministic alignments between the automata.•Memoization techniques are used to speed up the computation of alignments.•A decomposition-based approach divides the process model into S-Components.•A recomposition technique merges partial results into a final alignment.
论文关键词:Process mining,Conformance checking,Automata,Petri nets,S-components
论文评审过程:Received 27 August 2019, Revised 4 May 2020, Accepted 19 May 2020, Available online 22 May 2020, Version of Record 7 August 2020.
论文官网地址:https://doi.org/10.1016/j.is.2020.101561