{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T04:14:48Z","timestamp":1791173688052,"version":"4.1.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2015,11,1]],"date-time":"2015-11-01T00:00:00Z","timestamp":1446336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Serv. Comput."],"published-print":{"date-parts":[[2015,11,1]]},"DOI":"10.1109\/tsc.2015.2477815","type":"journal-article","created":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T23:19:26Z","timestamp":1441927166000},"page":"874-888","source":"Crossref","is-referenced-by-count":28,"title":["An Automated Approach for Assisting the Design of Configurable Process Models"],"prefix":"10.1109","volume":"8","author":[{"given":"Nour","family":"Assy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nguyen Ngoc","family":"Chan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walid","family":"Gaaloul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","author":"mendling","year":"2008","journal-title":"Metrics for Process Models Empirical Foundations of Verification Error Prediction and Guidelines for Correctness"},{"key":"ref38","article-title":"Detection and prediction of errors in epc business process models","author":"mendling","year":"2007"},{"key":"ref33","first-page":"486","article-title":"Configurable process models: Experiences from a municipality case study","author":"gottschalk","year":"0","journal-title":"Proc 21th Int Conf Adv Inf Syst Eng"},{"key":"ref32","author":"salomon","year":"2007","journal-title":"Data Compression The Complete Reference"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2011.01.004"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"ref37","first-page":"290","article-title":"Cohesion and coupling metrics for workflow process design","author":"reijers","year":"0","journal-title":"Proc 2nd Int Conf Bus Process Manage"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1141277.1141633"},{"key":"ref35","first-page":"117","article-title":"A discourse on complexity of process models","author":"cardoso","year":"0","journal-title":"Proc Int Conf Bus Process Manage Workshops"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICWS.2005.57"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88871-0_28"},{"key":"ref40","first-page":"55","article-title":"Business process design by view integration","author":"mendling","year":"0","journal-title":"Proc Bus Process Manage Workshops"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SCC.2013.97"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40176-3_5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88875-8_47"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2011.12.003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34321-6_38"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.12.012"},{"key":"ref17","first-page":"398","article-title":"Process fragments","author":"eberle","year":"0","journal-title":"Proc OTM Conf (1)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.09.006"},{"key":"ref19","first-page":"211","article-title":"Increasing recall of process model matching by improved activity label matching","author":"klinkmueller","year":"0","journal-title":"Proc Int Conf Bus Process Manage"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32885-5_24"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.10.011"},{"key":"ref27","first-page":"48","article-title":"Graph matching algorithms for business process model similarity search","author":"dijkman","year":"0","journal-title":"Proc 7th Int Conf Bus Process Manage"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2005.05.003"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-642-17358-5_16","article-title":"Creating context-adaptive business processes","volume":"6470","author":"hermosillo","year":"0","journal-title":"Proc 8th Int Conf Serv -Oriented Comput"},{"key":"ref29","first-page":"227","article-title":"Trace alignment in process mining: Opportunities for process diagnostics","author":"bose","year":"0","journal-title":"Proc 8th Int Conf Bus Process Manage"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/EDOC.2011.25"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2430545.2430547"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218843008001798"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2011.452"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30409-5"},{"key":"ref9","first-page":"86","article-title":"Merging business process variants","author":"derguech","year":"0","journal-title":"Proc 14th Int Conf Bus Inf Syst"},{"key":"ref20","author":"jurafsky","year":"2009","journal-title":"Speech and Language Processing"},{"key":"ref22","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3115\/1117794.1117802"},{"key":"ref24","first-page":"296","article-title":"An Information-theoretic definition of similarity","author":"lin","year":"0","journal-title":"Proc 15th Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-6846-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3115\/1614025.1614037"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.09.004"},{"key":"ref26","first-page":"48","article-title":"Graph matching algorithms for business process model similarity search","author":"dijkman","year":"0","journal-title":"Proc 7th Int Conf Bus Process Manage"},{"key":"ref25","article-title":"Efficient graph matching algorithms","author":"messmer","year":"1995"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.07.001"}],"container-title":["IEEE Transactions on Services Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4629386\/7348817\/07254236.pdf?arnumber=7254236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:45Z","timestamp":1641988005000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7254236\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,1]]},"references-count":43,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tsc.2015.2477815","relation":{},"ISSN":["1939-1374"],"issn-type":[{"value":"1939-1374","type":"print"}],"subject":[],"published":{"date-parts":[[2015,11,1]]}}}