A Method to Calculate the Process Similarity of the Manufacturing System Based on Tree Edit Distance

Article Preview

Abstract:

For various applications in today’s workflow systems, such as process-discovering or clustering, it is necessary to measure the distance between two workflow models. In this paper, we proposed a method to calculate the distance between structured workflows based on tree edit distance. First, we transform workflows into structure trees, and calculate the edit distance between structure trees. Three properties of the workflow distance of workflows are proved, i.e., reflexivity, symmetry, triangle inequality. These properties make the distance measure can be used as a quantitative tool in effective workflow model management activities. We illustrate the methodology with case study, by which its features are shown.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

699-703

Citation:

Online since:

July 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Peter MU Schmitz, Antony K Cooper. A structured workflow for implementing digital archiving standards in an organization. African Digital Scholarship & Curation 2009, Pretoria, 12-14 May (2009).

Google Scholar

[2] Remco Dijkman, MarlonDumas, BoudewijnvanDongen, ReinaKaarik, JanMendling. Similarity of business process models: Metrics and evaluation. Information Systems 36 (2011) 498–516.

DOI: 10.1016/j.is.2010.09.006

Google Scholar

[3] Xitong Guo. A dataflow perspective for business process integration.

Google Scholar

[4] Liangzhao Zeng, Boualem Benatallah, Marlon Dumas. QoS Aware Middleware for Web Services Composition. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 30, NO. 5, MAY (2004).

DOI: 10.1109/tse.2004.11

Google Scholar

[5] Xiaodong Fu, Ping Zou, Kun Yue, Ying Jiang. A Control-Flow Complexity Measure of Web Service Composition Process. 2010 IEEE Asia-Pacific Services Computing Conference.

DOI: 10.1109/apscc.2010.27

Google Scholar

[6] Jussi Vanhatalo, Hagen Volzer., Jana Koehler. The refined process structure tree. Data & Knowledge Engineering 68 (2009) 793–818.

DOI: 10.1016/j.datak.2009.02.015

Google Scholar

[7] Kaizhong Zhang, Dennis Shasha. Simple Fast Algorithms for The Editing Distance Between Trees and Related Problems. 1989 Society for Industrial and Applied Mathematics, Vol. 18, No. 6, pp.1245-1262, December 1989.

DOI: 10.1137/0218082

Google Scholar

[8] Joonsoo Bae, Ling Liu, James Caverlee, Liang-Jie Zhang. Development of Distance Measures for Process Mining, Discovery, and Integration. International Journal of Web Services Research, Volume 4, Issue 4.

DOI: 10.4018/jwsr.2007100101

Google Scholar