• Journal of Internet Computing and Services
• /
• v.4 no.6
• /
• pp.43-55
• /
• 2003

Workflow mining is a newly emerging research issue for rediscovering and reengineering workflow models from workflow logs containing information about workflows being executed on the workflow engine. In this paper, we proposed workcase mining which was used dependency among activities. Main purpose of this paper is to minimize discrepancies between the modeled workflow process and the enacted workflow process as it is actually being executed. That is, we can get a complete set of activity firing sequences on buildtime. Besides, we can discover from workflow logs that which path out of all reachable paths a workcase has actually followed through on runtime. For this purpose we proposed two algorithm, the one is 'Activily-Dependent Net Algorithm' and the other is 'E-Walk Series Analysis Algorithm'.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.437-446
• /
• 2005

Workflow mining is a newly emerging research issue for rediscovering and reengineering workflow models from workflow logs containing information about workflow being executed on the workflow engine. This paper newly defines a workflow process reduction mechanism that formally and automatically reduces an original workflow process to a minimal set of activities, which was used proposed 'E-walk series analysis algorithm'. Main purpose of this paper is to minimize discrepancies between the workflow process modeled and the enacted workflow process as it is actually being executed. That means, we compare a complete set of activity firing sequences on buildtime with workflow execution logs which was generate on runtime. For this purpose we proposed two algorithm, the one is 'Activity-Dependent Net Algorithm' and the other is 'E-Walk Series Analysis Algorithm'.