Abstract: To solve the problem of mining loops in parallel structures, an αfsl algorithm for mining a class of special loop structures is proposed based on α algorithm. The completeness of the logs containing the loop structures is redefined in the algorithm, and a new loop order relation is added to the basic activity order relation. By preprocessing the logs, repetitive activities are extracted and the adjacent relation of them is listed in the algorithm. Based on the adjacent relation, the loop structure in a log is found. By adding a loop structure, a process model based on the workflow nets is mined. Finally, the effectiveness and correctness of αfsl algorithm are verified by an example of a computer maintenance company.

Key words: process mining, loop structure, log completeness, workflow nets

摘要： 为解决并发结构中循环挖掘问题，在α算法基础上，针对一类特殊循环结构提出了一种αfsl算法。该算法重新定义了包含循环结构的日志完备性，并在基本活动次序关系的基础上，添加了新的循环次序关系。通过预处理日志，提取日志中重复出现的活动，列出重复活动的相邻关系，从中发现日志中存在的循环结构，以后期添加循环结构的方式挖掘基于工作流网的过程模型。最后，通过对某电脑维修公司的实例分析，验证了αfsl算法的有效性与正确性。

关键词: 过程挖掘, 循环结构, 日志完备性, 工作流网