{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T06:48:38Z","timestamp":1773298118572,"version":"3.50.1"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001837","name":"Estonian Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP110100252"],"award-info":[{"award-number":["LP110100252"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Estonian Centre of Excellence in Computer Science"},{"DOI":"10.13039\/501100008530","name":"ERDF","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ICT Centre of Excellence program"},{"DOI":"10.13039\/501100000935","name":"Department of Broadband, Communications and the Digital Economy , Australian Government","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000935","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008242","name":"NICTA","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008242","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Softw. Eng. Methodol."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p>\n            This article addresses the problem of constructing consolidated business process models out of collections of process models that share common fragments. The article considers the construction of unions of multiple models (called\n            <jats:italic>merged models<\/jats:italic>\n            ) as well as intersections (called\n            <jats:italic>digests<\/jats:italic>\n            ). Merged models are intended for analysts who wish to create a model that subsumes a collection of process models -- typically representing variants of the same underlying process -- with the aim of replacing the variants with the merged model. Digests, on the other hand, are intended for analysts who wish to identify the most recurring fragments across a collection of process models, so that they can focus their efforts on optimizing these fragments. The article presents an algorithm for computing merged models and an algorithm for extracting digests from a merged model. The merging and digest extraction algorithms have been implemented and tested against collections of process models taken from multiple application domains. The tests show that the merging algorithm produces compact models and scales up to process models containing hundreds of nodes. Furthermore, a case study conducted in a large insurance company has demonstrated the usefulness of the merging and digest extraction operators in a practical setting.\n          <\/jats:p>","DOI":"10.1145\/2430545.2430547","type":"journal-article","created":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T19:39:32Z","timestamp":1364845172000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":111,"title":["Business Process Model Merging"],"prefix":"10.1145","volume":"22","author":[{"given":"Marcello","family":"La Rosa","sequence":"first","affiliation":[{"name":"Queensland University of Technology and NICTA, Australia"}]},{"given":"Marlon","family":"Dumas","sequence":"additional","affiliation":[{"name":"University of Tartu, Estonia"}]},{"given":"Reina","family":"Uba","sequence":"additional","affiliation":[{"name":"University of Tartu, Estonia"}]},{"given":"Remco","family":"Dijkman","sequence":"additional","affiliation":[{"name":"Eindhoven University of Technology, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2013,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-009-0112-0"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDOC.2009.11"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.09.006"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of VLDB. Morgan Kaufmann, 610--621","author":"Do H. H.","unstructured":"Do , H. H. and Rahm , E . 2002. Coma - A system for flexible combination of schema matching approaches . In Proceedings of VLDB. Morgan Kaufmann, 610--621 . Do, H. H. and Rahm, E. 2002. Coma - A system for flexible combination of schema matching approaches. In Proceedings of VLDB. Morgan Kaufmann, 610--621."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88871-0_28"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1793114.1793131"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85758-7_19"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the CAiSE\u20192008 Forum. CEUR Workshop Proceedings","volume":"344","author":"K\u00fcster J.","unstructured":"K\u00fcster , J. , Gerth , C. , F\u00f6rster , A. , and Engels , G . 2008b. A tool for process merging in business-driven development . In Proceedings of the CAiSE\u20192008 Forum. CEUR Workshop Proceedings , vol. 344 , 89--92. K\u00fcster, J., Gerth, C., F\u00f6rster, A., and Engels, G. 2008b. A tool for process merging in business-driven development. In Proceedings of the CAiSE\u20192008 Forum. CEUR Workshop Proceedings, vol. 344, 89--92."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.07.001"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"La Rosa M. Dumas M. Uba R. and Dijkman R. 2010. Merging business process models. In Proceedings of CoopIS. Lecture Notes in Computer Science. Springer.   La Rosa M. Dumas M. Uba R. and Dijkman R. 2010. Merging business process models. In Proceedings of CoopIS . Lecture Notes in Computer Science. Springer.","DOI":"10.1007\/978-3-642-16934-2_10"},{"key":"e_1_2_1_12_1","first-page":"707","article-title":"Binary code capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein I.","year":"1966","unstructured":"Levenshtein , I. 1966 . Binary code capable of correcting deletions, insertions and reversals . Cybernet. Control Theory 10 , 8, 707 -- 710 . Levenshtein, I. 1966. Binary code capable of correcting deletions, insertions and reversals. Cybernet. Control Theory 10, 8, 707--710.","journal-title":"Cybernet. Control Theory"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843010002139"},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of ICDE. IEEE Computer Society, 117--128","author":"Melnik S.","unstructured":"Melnik , S. , Garcia-Molina , H. , and Rahm , E . 2002. Similarity flooding: A versatile graph matching algorithm and its application to schema matching . In Proceedings of ICDE. IEEE Computer Society, 117--128 . Melnik, S., Garcia-Molina, H., and Rahm, E. 2002. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In Proceedings of ICDE. IEEE Computer Society, 117--128."},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Business Information Processing","volume-title":"Error Prediction, and Guidelines for Correctness","author":"Mendling J.","unstructured":"Mendling , J. 2009. Metrics for Process Models: Empirical Foundations of Verification , Error Prediction, and Guidelines for Correctness . Lecture Notes in Business Information Processing , vol. 6 , Springer . Mendling, J. 2009. Metrics for Process Models: Empirical Foundations of Verification, Error Prediction, and Guidelines for Correctness. Lecture Notes in Business Information Processing, vol. 6, Springer."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11837862_7"},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of BPM. 48--63","author":"Mendling J.","unstructured":"Mendling , J. , Reijers , H. A. , and Cardoso , J . 2007. What makes process models understandable? In Proceedings of BPM. 48--63 . Mendling, J., Reijers, H. A., and Cardoso, J. 2007. What makes process models understandable? In Proceedings of BPM. 48--63."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2009.08.004"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1000449"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of FUSION.","author":"Mitra P.","unstructured":"Mitra , P. , Wiederhold , G. , and Jannink , J . 1999. Semi-automatic integration of knowledge sources . In Proceedings of FUSION. Mitra, P., Wiederhold, G., and Jannink, J. 1999. Semi-automatic integration of knowledge sources. In Proceedings of FUSION."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.50"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/940071.940102"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of AAAI. AAAI, 1024--1025","author":"Pedersen T.","unstructured":"Pedersen , T. , Patwardhan , S. , and Michelizzi , J . 2004. WordNet: Similarity - Measuring the Relatedness of Concepts . In Proceedings of AAAI. AAAI, 1024--1025 . Pedersen, T., Patwardhan, S., and Michelizzi, J. 2004. WordNet: Similarity - Measuring the Relatedness of Concepts. In Proceedings of AAAI. AAAI, 1024--1025."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.09.004"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.05.003"},{"key":"e_1_2_1_27_1","volume-title":"Data Compression: The Complete Reference","author":"Salomon D.","year":"2006","unstructured":"Salomon , D. 2006 . Data Compression: The Complete Reference 4 th Ed. Springer . Salomon, D. 2006. Data Compression: The Complete Reference 4th Ed. Springer.","edition":"4"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2005.07.001"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69534-9_34"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of CAiSE. Lecture Notes in Computer Science","volume":"6051","author":"Weidlich M.","unstructured":"Weidlich , M. , Dijkman , R. , and Mendling , J . 2010. The ICoP framework: Identification of correspondences between process models . In Proceedings of CAiSE. Lecture Notes in Computer Science , vol. 6051 , Springer. Weidlich, M., Dijkman, R., and Mendling, J. 2010. The ICoP framework: Identification of correspondences between process models. In Proceedings of CAiSE. Lecture Notes in Computer Science, vol. 6051, Springer."}],"container-title":["ACM Transactions on Software Engineering and Methodology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2430545.2430547","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2430545.2430547","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:23Z","timestamp":1750235723000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2430545.2430547"}},"subtitle":["An Approach to Business Process Consolidation"],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1145\/2430545.2430547"],"URL":"https:\/\/doi.org\/10.1145\/2430545.2430547","relation":{},"ISSN":["1049-331X","1557-7392"],"issn-type":[{"value":"1049-331X","type":"print"},{"value":"1557-7392","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"2010-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}