一种发现复杂工作流结构的扩展α算法  

Extended α-algorithm to discovery complex workflow structures

作　　者：陈信敏[1] 滕少华[1] 

机构地区：[1]广东工业大学计算机学院,广州510006

出　　处：《计算机应用研究》2011年第2期536-540,共5页Application Research of Computers

基　　金：广东省自然科学基金资助项目(9151009001000007)

摘　　要：通过分析当前工作流挖掘中存在的多种复杂结构并存的问题,基于α**算法中对重复任务处理的方法,提出一种能够发现工作流日志中包含循环、重复以及非自由选择等复杂结构的算法。该算法首先对α**算法中对重复任务处理的方法进行改进,进而对非自由选择结构进行分析,给出判定非自由选择任务的方法,并用Petri网进行建模;最后对本算法进行了初步实现并验证其可行性。This paper first analyzed the problem of process mining with mutil-complex structures,proposed an approach of accounting complex structures which include circulatory,duplicates,and non-free-choice in workflow logs on the basis of the way of dealing with duplicate tasks in the algorithm of α＊＊.This way of accounting firstly improved theorem of handling duplicates tasks;then it analyzed structures of non-free-choice,provided ways of judging tasks of non-free-choice,and established models via Petri net.In the final part,the writer realizes this way of accounting and verifies its feasibilities.

关 键 词：PETRI网 过程挖掘 复杂结构 工作流 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]