Comparing process models in the BPMN 2.0 XML format
https://doi.org/10.15514/ISPRAS-2015-27(3)-17
Abstract
Comparing business process models is one of the most significant challenges for business and systems analysts. The complexity of the problem is explained by the fact there is a lack of tools that can be used for comparing business process models. Also there is no universally accepted standard for modeling them. EPC, YAWL, BPEL, XPDL and BPMN are only a small fraction of available notations that have found acceptance among developers. Every process modeling standard has its advantages and disadvantages, but almost all of them comprise an XML schema, which defines process serialization rules. Due to the fact that XML naturally represents hierarchical and reference structure of business process models, these models can be compared using their XML representations. In this paper we propose a generic comparison approach, which is applicable to XML representations of business process models. Using this approach we have developed a tool, which currently supports BPMN 2.0 [1] (one of the most popular business process modeling notations), but can be extended to support other business process modeling standards.
About the Authors
Sergey Ivanov
PAIS laboratory, National Research University Higher School of Economics
Russian Federation
Russian Federation
Anna Kalenkova
PAIS laboratory, National Research University Higher School of Economics
Russian Federation
Russian Federation
References
1. Stephen A. White. Introduction to BPMN [Online]. Available: http://www.omg.org/bpmn/Documents/Introduction_to_BPMN.pdf
2. W. M. P. van der Aalst, Process Mining: Discovery, Conformance and Enhancement of Business Processes, Springer-Verlag, Berlin, Germany, 2011.
3. D.Sanko and J. Kruskal, Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, Addison-Wesley, 1983.
4. V. Levenshtein, Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1965, pp. 1-17.
5. V. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, pp. 10-707, 1966. Original in Russian in Doklady Akademii Nauk SSSR, 1965, pp. 163-848.
6. F. Damerau. A technique for computer detection and correction of spelling errors. Comm. of the ACM, 1964, pp. 7-176.
7. Xinbo Gao, Bing Xiao, Dacheng Tao, Xuelong Li, "A survey of graph edit distance" in Pattern Analysis and Applications, vol. 13, 2010, pp. 113-129.
8. B.F. van Dongen, J. Mendling, and W.M.P. van der Aalst, "Structural Patterns for Soundness of Business Process Models" in EDOC 2006 - International Enterprise Distributed Object Computing Conference, Hong Kong, 2006, pp. 116-128.
9. Object Management Group, "BPMN 2.0," [Online]. Available: http://www.omg.org/spec/BPMN/2.0/
10. Process Mining Group, Eindhoven Technical University, "ProM 6," [Online]. Available: http://www.promtools.org/
Review
For citations:
Ivanov S., Kalenkova A. Comparing process models in the BPMN 2.0 XML format. Proceedings of the Institute for System Programming of the RAS (Proceedings of ISP RAS). 2015;27(3):255-266. (In Russ.) https://doi.org/10.15514/ISPRAS-2015-27(3)-17
Email this article 