WORKFLOW TREES FOR REPRESENTATION AND MINING OF IMPLICITLY CONCURRENT BUSINESS PROCESSES

Daniel Nikovski

Abstract

We propose a novel representation of business processes called workflow trees that facilitates the mining of process models where the parallel execution of two or more sub-processes has not been recorded explicitly in workflow logs. Based on the provable property of workflow trees that a pair of tasks are siblings in the tree if and only if they have identical respective workflow-log relations with each and every remaining third task in the process, we describe an efficient business process mining algorithm of complexity only cubic in the number of process tasks, and analyze the class of processes that can be identified and reconstructed by it.

References

  1. Cook, J. E. and Wolf, A. L. (1998a). Discovering models of software processes from event-based data. ACM Trans. Softw. Eng. Methodol., 7(3):215-249.
  2. Cook, J. E. and Wolf, A. L. (1998b). Event-based detection of concurrency. In SIGSOFT 7898/FSE-6: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering, pages 35-45, New York, NY, USA. ACM Press.
  3. de Medeiros, A., van Dongen, B., van der Aalst, W., and Weijters, A. (2004). Process mining: Extending the a- algorithm to mine short loops. BETA Working Paper Series, WP 113, Eindhoven University of Technology, Eindhoven.
  4. List, B. and Korherr, B. (2006). An evaluation of conceptual business process modelling languages. In SAC 7806: Proceedings of the 2006 ACM symposium on Applied computing, pages 1532-1539, New York, NY, USA. ACM Press.
  5. Nikovski, D. and Baba, A. (2007). Workflow trees for representation and mining of implicitly concurrent business processes. Technical Report TR2007-072, Mitsubishi Electric Research Labs, www.merl.com/publications/TR2007-072.
  6. Schimm, G. (2004). Mining exact models of concurrent workflows. Comput. Ind., 53(3):265-281.
  7. Sedgewick, R. (2002). Algorithms in C. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA.
  8. Silva, R., Zhang, J., and Shanahan, J. G. (2005). Probabilistic workflow mining. In KDD 7805: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 275-284, New York, NY, USA. ACM Press.
  9. van der Aalst, W., Weijters, T., and Maruster, L. (2004). Workflow mining: Discovering process models from event logs. IEEE Transactions on Knowledge and Data Engineering, 16(9):1128-1142.
  10. van der Aalst, W. M. P. and van Hee, K. M. (2002). Workflow Management: Models, Methods, and Systems. MIT Press.
  11. van der Aalst, W. M. P. and Weijters, A. J. M. M. (2004). Process mining: a research agenda. Comput. Ind., 53(3):231-244.
Download


Paper Citation


in Harvard Style

Nikovski D. (2008). WORKFLOW TREES FOR REPRESENTATION AND MINING OF IMPLICITLY CONCURRENT BUSINESS PROCESSES . In Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS, ISBN 978-989-8111-38-8, pages 30-36. DOI: 10.5220/0001671900300036


in Bibtex Style

@conference{iceis08,
author={Daniel Nikovski},
title={WORKFLOW TREES FOR REPRESENTATION AND MINING OF IMPLICITLY CONCURRENT BUSINESS PROCESSES},
booktitle={Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS,},
year={2008},
pages={30-36},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001671900300036},
isbn={978-989-8111-38-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Tenth International Conference on Enterprise Information Systems - Volume 6: ICEIS,
TI - WORKFLOW TREES FOR REPRESENTATION AND MINING OF IMPLICITLY CONCURRENT BUSINESS PROCESSES
SN - 978-989-8111-38-8
AU - Nikovski D.
PY - 2008
SP - 30
EP - 36
DO - 10.5220/0001671900300036