Workflow Mining Alpha Algorithm — A Complexity Study

Conference paper
Part of the Advances in Soft Computing book series (AINSC, volume 31)


Workflow mining algorithms are used to improve and/or refine design of existing workflows. Workflows are composed of sequential, parallel, conflict and iterative structures. In this paper we present results of experimental complexity study of the alpha workflow mining algorithm. We studied time and space complexity as dependent on workflow’s internal structure and on the number of workflow tasks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cook J.E., Wolf A.L. (1998) Discovering Models of Software Processes from Event-Based Data. ACM Trans. on Software Engineering and Methodology, 7(3), 215–249, Springer, Berlin Heidelberg.Google Scholar
  2. 2.
    van der Aalst W.M.P., Weijters A.J.M.N., Maruster L. (2002) Workflow Mining: Which Processes can be Rediscovered? WP 74, Eindhoven University of Technology.Google Scholar
  3. 3.
    van der Aalst W.M.P., Weijters A.J.M.M., Maruster L, (2004) Workflow Mining: Discovering Process Models from Event Logs. IEEE Trans. on Knowledge and Data Engineering.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Computer and Information Science DepartmentUniversity of Massachusetts DartmouthDartmouthUSA

Personalised recommendations