{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T06:40:22Z","timestamp":1776580822723,"version":"3.51.2"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.infsof.2026.108128","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:34:31Z","timestamp":1774283671000},"page":"108128","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Semantic comparison of business process models assisted by syntactic matching"],"prefix":"10.1016","volume":"195","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5864-8094","authenticated-orcid":false,"given":"Francisco","family":"Dur\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwen","family":"Sala\u00fcn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.infsof.2026.108128_b1","series-title":"Fundamentals of Business Process Management","author":"Dumas","year":"2018"},{"issue":"1","key":"10.1016\/j.infsof.2026.108128_b2","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/isre.11.1.17.11787","article-title":"A formal approach to workflow analysis","volume":"11","author":"Basu","year":"2000","journal-title":"Inf. Syst. Res."},{"key":"10.1016\/j.infsof.2026.108128_b3","doi-asserted-by":"crossref","DOI":"10.1016\/j.jss.2021.111007","article-title":"A formal approach for the analysis of BPMN collaboration models","volume":"180","author":"Corradini","year":"2021","journal-title":"J. Syst. Softw."},{"issue":"3","key":"10.1016\/j.infsof.2026.108128_b4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0169-023X(97)00033-5","article-title":"Workflow evolution","volume":"24","author":"Casati","year":"1998","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.infsof.2026.108128_b5","series-title":"Proceedings of COOPIS","first-page":"310","article-title":"Managing evolving workflow specifications","author":"Joeris","year":"1998"},{"key":"10.1016\/j.infsof.2026.108128_b6","article-title":"Concurrent workflow evolution","volume":"37","author":"Sonntag","year":"2011","journal-title":"Electron. Commun. Eur. Assoc. Softw. Sci. Technol."},{"key":"10.1016\/j.infsof.2026.108128_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.scico.2018.09.007","article-title":"Checking Business Process Evolution","volume":"170","author":"Krishna","year":"2019","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.infsof.2026.108128_b8","series-title":"Proceedings of Second International Conference on Smart Energy and Communication","first-page":"363","article-title":"Business process reengineering: Issues and challenges","author":"Harika","year":"2021"},{"issue":"22","key":"10.1016\/j.infsof.2026.108128_b9","doi-asserted-by":"crossref","DOI":"10.3390\/su132212341","article-title":"Business process re-engineering to digitalise quality control checks for reducing physical waste and resource use in a food company","volume":"13","author":"Garcia-Garcia","year":"2021","journal-title":"Sustainability"},{"key":"10.1016\/j.infsof.2026.108128_b10","series-title":"Proc. of ICSOC","first-page":"3","article-title":"Optimization of BPMN processes via automated refactoring","volume":"vol. 13740","author":"Dur\u00e1n","year":"2022"},{"key":"10.1016\/j.infsof.2026.108128_b11","series-title":"Proc. of SEFM\u201923","first-page":"226","article-title":"Refactoring of Multi-instance BPMN Processes with Time and Resources","volume":"vol. 14323","author":"Nivon","year":"2023"},{"key":"10.1016\/j.infsof.2026.108128_b12","series-title":"Proc. of QRS\u201924","first-page":"677","article-title":"Semi-automated refactoring of BPMN processes","author":"Nivon","year":"2024"},{"key":"10.1016\/j.infsof.2026.108128_b13","series-title":"International Standard 19510, Information technology \u2013 Business Process Model and Notation","author":"ISO\/IEC","year":"2013"},{"key":"10.1016\/j.infsof.2026.108128_b14","series-title":"Communication and concurrency","author":"Milner","year":"1989"},{"issue":"3","key":"10.1016\/j.infsof.2026.108128_b15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/233551.233556","article-title":"Branching Time and Abstraction in Bisimulation Semantics","volume":"43","author":"van Glabbeek","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/j.infsof.2026.108128_b16","series-title":"Proc. of ASE","first-page":"217","article-title":"BProVe: A Formal Verification Framework for Business Process Models","author":"Corradini","year":"2017"},{"key":"10.1016\/j.infsof.2026.108128_b17","series-title":"Proceedings of the Best Dissertation Award, Doctoral Consortium, and Demonstration & Resources Forum At BPM 2023 Co-Located with 21st International Conference on Business Process Management (BPM 2023)","first-page":"122","article-title":"BPMN inspector: A tool for extracting features from BPMN models","volume":"vol. 3469","author":"Compagnucci","year":"2023"},{"issue":"1","key":"10.1016\/j.infsof.2026.108128_b18","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s12599-023-00818-7","article-title":"A study on the usage of the BPMN notation for designing process collaboration, choreography, and conversation models","volume":"66","author":"Compagnucci","year":"2024","journal-title":"Bus. Inf. Syst. Eng."},{"key":"10.1016\/j.infsof.2026.108128_b19","series-title":"Business Process Modeling Notation - Second International Workshop, BPMN 2010. Proceedings","first-page":"1","article-title":"Unraveling unstructured process models","volume":"vol. 67","author":"Dumas","year":"2010"},{"key":"10.1016\/j.infsof.2026.108128_b20","series-title":"Proc. of IFM\u201922","first-page":"191","article-title":"Probabilistic model checking of BPMN processes at runtime","volume":"vol. 13274","author":"Falcone","year":"2022"},{"key":"10.1016\/j.infsof.2026.108128_b21","series-title":"Proc. of FACS\u201922","first-page":"90","article-title":"Debugging of BPMN processes using coloring techniques","volume":"vol. 13712","author":"Nivon","year":"2022"},{"key":"10.1016\/j.infsof.2026.108128_b22","series-title":"Petri Nets: Applications and Relationships To Other Models of Concurrency","first-page":"325","article-title":"Event structures","author":"Winskel","year":"1987"},{"key":"10.1016\/j.infsof.2026.108128_b23","series-title":"Handbook of Logic in Computer Science","first-page":"1","article-title":"Models for concurrency","author":"Winskel","year":"1995"},{"issue":"4","key":"10.1016\/j.infsof.2026.108128_b24","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/3625564","article-title":"Rooted divergence-preserving branching bisimilarity is a congruence for guarded CCS","volume":"35","author":"Sun","year":"2023","journal-title":"Form. Asp. Comp."},{"key":"10.1016\/j.infsof.2026.108128_b25","series-title":"Proc. of ICALP\u201991","first-page":"76","article-title":"Safety for branching time semantics","volume":"vol. 510","author":"Bouajjani","year":"1991"},{"issue":"3\u20135","key":"10.1016\/j.infsof.2026.108128_b26","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s00236-019-00355-5","article-title":"Congruence from the operator\u2019s point of view","volume":"57","author":"Gazda","year":"2020","journal-title":"Acta Inform."},{"key":"10.1016\/j.infsof.2026.108128_b27","article-title":"All About Maude - A High-Performance Logical Framework","volume":"vol. 4350","author":"Clavel","year":"2007"},{"key":"10.1016\/j.infsof.2026.108128_b28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.scico.2018.08.007","article-title":"Stochastic Analysis of BPMN with Time in Rewriting Logic","volume":"168","author":"Dur\u00e1n","year":"2018","journal-title":"Sci. Comput. Program."},{"key":"10.1016\/j.infsof.2026.108128_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.scico.2019.102303","article-title":"A Rewriting Logic Approach to Resource Allocation Analysis in Business Process Models","volume":"183","author":"Dur\u00e1n","year":"2019","journal-title":"Sci. Comput. Program."},{"issue":"15","key":"10.1016\/j.infsof.2026.108128_b30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","article-title":"CADP 2011: A Toolbox for the Construction and Analysis of Distributed Processes","volume":"2","author":"Garavel","year":"2013","journal-title":"STTT"},{"key":"10.1016\/j.infsof.2026.108128_b31","article-title":"Ground confluence of order-sorted conditional specifications modulo axioms","volume":"111","author":"Dur\u00e1n","year":"2020","journal-title":"J. Log. Algebraic Methods Program."},{"key":"10.1016\/j.infsof.2026.108128_b32","series-title":"Proc. of COORDINATION","first-page":"219","article-title":"Verifying timed BPMN processes using Maude","volume":"vol. 10319","author":"Dur\u00e1n","year":"2017"},{"key":"10.1016\/j.infsof.2026.108128_b33","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/j.infsof.2026.108128_b34","series-title":"Reference Manual of the LNT to LOTOS Translator (Version 6.7)","author":"Champelovier","year":"2018"},{"key":"10.1016\/j.infsof.2026.108128_b35","series-title":"Proc. of ICFEM","first-page":"355","article-title":"A process semantics for BPMN","volume":"vol. 5256","author":"Wong","year":"2008"},{"issue":"2","key":"10.1016\/j.infsof.2026.108128_b36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.entcs.2009.06.029","article-title":"A Relative Timed Semantics for BPMN","volume":"229","author":"Wong","year":"2009","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"10.1016\/j.infsof.2026.108128_b37","series-title":"Efficient Comparison of BPMN Processes \u2013 GitHub Repository","year":"2025"},{"key":"10.1016\/j.infsof.2026.108128_b38","series-title":"Proc. of WRLA","first-page":"274","article-title":"Maude as a library: An efficient all-purpose programming interface","volume":"vol. 13252","author":"Rubio","year":"2022"},{"key":"10.1016\/j.infsof.2026.108128_b39","series-title":"Proc. of APSEC","first-page":"377","article-title":"Quantifying the similarity of BPMN processes","author":"Sala\u00fcn","year":"2022"},{"key":"10.1016\/j.infsof.2026.108128_b40","series-title":"Proc. of BPM","first-page":"35","article-title":"BPMNDiffViz: A Tool for BPMN Models Comparison","volume":"vol. 1418","author":"Ivanov","year":"2015"},{"issue":"1","key":"10.1016\/j.infsof.2026.108128_b41","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2478\/v10179-012-0003-6","article-title":"Foundation for Equivalences of BPMN Models","volume":"24","author":"Lam","year":"2012","journal-title":"Theor. Appl. Inform."},{"issue":"11","key":"10.1016\/j.infsof.2026.108128_b42","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1093\/comjnl\/bxs014","article-title":"Behaviour Equivalence and Compatibility of Business Process Models with Complex Correspondences","volume":"55","author":"Weidlich","year":"2012","journal-title":"Comput. J."},{"key":"10.1016\/j.infsof.2026.108128_b43","series-title":"Proc. of BPM","first-page":"78","article-title":"Deciding Behaviour Compatibility of Complex Correspondences between Process Models","volume":"vol.6336","author":"Weidlich","year":"2010"},{"key":"10.1016\/j.infsof.2026.108128_b44","doi-asserted-by":"crossref","unstructured":"B. van Dongen, R. Dijkman, J. Mendling, Measuring Similarity between Business Process Models, in: Proc. of CAISE\u201908, 2008, pp. 450\u2013464.","DOI":"10.1007\/978-3-540-69534-9_34"},{"issue":"1","key":"10.1016\/j.infsof.2026.108128_b45","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.datak.2007.06.010","article-title":"Quantifying Process Equivalence Based on Observed Behavior","volume":"64","author":"de Medeiros","year":"2008","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"10.1016\/j.infsof.2026.108128_b46","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.is.2010.09.006","article-title":"Similarity of business process models: Metrics and evaluation","volume":"36","author":"Dijkman","year":"2011","journal-title":"Inf. Syst."},{"key":"10.1016\/j.infsof.2026.108128_b47","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.is.2014.11.010","article-title":"Detecting approximate clones in business process model repositories","volume":"49","author":"Rosa","year":"2015","journal-title":"Inf. Syst."},{"key":"10.1016\/j.infsof.2026.108128_b48","series-title":"Proc. of BPMDS\/EMMSAD","first-page":"136","article-title":"Efficient Computation of Behavioral Changes in Declarative Process Models","volume":"vol. 479","author":"Sch\u00fctzenmeier","year":"2023"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584926001175?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0950584926001175?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:44:33Z","timestamp":1776577473000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0950584926001175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":48,"alternative-id":["S0950584926001175"],"URL":"https:\/\/doi.org\/10.1016\/j.infsof.2026.108128","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Semantic comparison of business process models assisted by syntactic matching","name":"articletitle","label":"Article Title"},{"value":"Information and Software Technology","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.infsof.2026.108128","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108128"}}