关键词: 隐变迁, 流程挖掘, 拟间接依赖关系, 整数线性规划, Petri网

Abstract: Hide transition exists in the business process, but it isn’t recorded in the log. Mining hide transition can restore the model and improve the running efficiency of the process. The existing methods are based on the direct dependency relationship between logs to mine hide transition, and do not consider their indirect dependencies, which have certain limitations. This paper proposes a method based on indirect dependencies mining hide transition. An initial model is constructed based on the behavior profile between activities in the event log, log sequence between the constraints of the body is found through the proposed indirect dependency table. Integral linear programming method is used to find the required quasi indirect relationship transition pairs, so as to explore the hide transition of quasi indirect relationship transition pairs. The hide transition is integrated into the initial model and the target model with hide transition is obtained. The validity of the method is verified by the concrete example analysis.

Key words: hide transition, process mining, quasi indirect dependence, integral linear programming, Petri net