{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T04:27:22Z","timestamp":1743827242327,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518301"},{"type":"electronic","value":"9783030518318"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51831-8_14","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T23:05:05Z","timestamp":1593471905000},"page":"280-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Automated Repair of Process Models Using Non-local Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5088-7602","authenticated-orcid":false,"given":"Anna","family":"Kalenkova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9656-254X","authenticated-orcid":false,"given":"Josep","family":"Carmona","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7672-1643","authenticated-orcid":false,"given":"Artem","family":"Polyvyanyy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-4035","authenticated-orcid":false,"given":"Marcello","family":"La Rosa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,30]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"van der Aalst, W.: Process Mining: Data Science in Action. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49851-4","DOI":"10.1007\/978-3-662-49851-4"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-47961-9_37","volume-title":"Advanced Information Systems Engineering","author":"WMP van der Aalst","year":"2002","unstructured":"van der Aalst, W.M.P., Hirnschall, A., Verbeek, H.M.W.: An alternative way to analyze workflow graphs. In: Pidduck, A.B., Ozsu, M.T., Mylopoulos, J., Woo, C.C. (eds.) CAiSE 2002. LNCS, vol. 2348, pp. 535\u2013552. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-47961-9_37"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10270-008-0106-z","volume":"9","author":"WM Van der Aalst","year":"2010","unstructured":"Van der Aalst, W.M., Rubin, V., Verbeek, H., van Dongen, B.F., Kindler, E., G\u00fcnther, C.W.: Process mining: a two-step approach to balance between underfitting and overfitting. Softw. Syst. Model. 9(1), 87 (2010)","journal-title":"Softw. Syst. Model."},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-69462-7_5","volume-title":"On the Move to Meaningful Internet Systems. OTM 2017 Conferences","author":"A Armas Cervantes","year":"2017","unstructured":"Armas Cervantes, A., van Beest, N.R.T.P., La Rosa, M., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Interactive and incremental business process model repair. In: Panetto, H., et al. (eds.) OTM 2017. LNCS, vol. 10573, pp. 53\u201374. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-69462-7_5"},{"issue":"2","key":"14_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10115-018-1214-x","volume":"59","author":"A Augusto","year":"2018","unstructured":"Augusto, A., Conforti, R., Dumas, M., La Rosa, M., Polyvyanyy, A.: Split miner: automated discovery of accurate and simple business process models from event logs. Knowl. Inf. Syst. 59(2), 251\u2013284 (2018). \nhttps:\/\/doi.org\/10.1007\/s10115-018-1214-x","journal-title":"Knowl. Inf. Syst."},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2018.2841877","volume":"31","author":"A Augusto","year":"2019","unstructured":"Augusto, A., et al.: Automated discovery of process models from event logs: review and benchmark. IEEE Trans. Knowl. Data Eng. 31(4), 686\u2013705 (2019)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR7","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47967-4","volume-title":"Petri Net Synthesis","author":"E Badouel","year":"2015","unstructured":"Badouel, E., Bernardinello, L., Darondeau, P.: Petri Net Synthesis. TTCSAES. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Bergenthum, R.: Prime miner - process discovery using prime event structures. In: 2019 International Conference on Process Mining (ICPM), pp. 41\u201348, June 2019","DOI":"10.1109\/ICPM.2019.00017"},{"issue":"4","key":"14_CR9","first-page":"437","volume":"88","author":"R Bergenthum","year":"2008","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from finite partial languages. Fundam. Inform. 88(4), 437\u2013468 (2008)","journal-title":"Fundam. Inform."},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-51963-0_13","volume-title":"SOFSEM 2017: Theory and Practice of Computer Science","author":"E Best","year":"2017","unstructured":"Best, E., Devillers, R., Schlachter, U.: A graph-theoretical characterisation of state separation. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017. LNCS, vol. 10139, pp. 163\u2013175. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-51963-0_13"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-85758-7_26","volume-title":"Business Process Management","author":"J Carmona","year":"2008","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: A region-based algorithm for discovering petri nets from event logs. In: Dumas, M., Reichert, M., Shan, M.-C. (eds.) BPM 2008. LNCS, vol. 5240, pp. 358\u2013373. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-85758-7_26"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TC.2009.131","volume":"59","author":"J Carmona","year":"2010","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded petri nets. IEEE Trans. Comput. 59(3), 371\u2013384 (2010)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Carmona, J., van Dongen, B.F., Solti, A., Weidlich, M.: Conformance Checking - Relating Processes and Models. Springer, Heidelberg (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99414-7","DOI":"10.1007\/978-3-319-99414-7"},{"issue":"8","key":"14_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/12.707587","volume":"47","author":"J Cortadella","year":"1998","unstructured":"Cortadella, J., Kishinevsky, M., Lavagno, L., Yakovlev, A.: Deriving petri nets from finite transition systems. IEEE Trans. Comput. 47(8), 859\u2013882 (1998)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526558","volume-title":"Free Choice Petri Nets","author":"J Desel","year":"1995","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, Cambridge (1995)"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J Desel","year":"1996","unstructured":"Desel, J., Reisig, W.: The synthesis problem of petri nets. Acta Inf. 33(4), 297\u2013315 (1996). \nhttps:\/\/doi.org\/10.1007\/s002360050046","journal-title":"Acta Inf."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.is.2013.12.007","volume":"47","author":"D Fahland","year":"2015","unstructured":"Fahland, D., van der Aalst, W.M.: Model repair \u2013 aligning process models to reality. Inf. Syst. 47, 220\u2013243 (2015)","journal-title":"Inf. Syst."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.is.2013.12.004","volume":"47","author":"C Favre","year":"2015","unstructured":"Favre, C., Fahland, D., V\u00f6lzer, H.: The relationship between workflow graphs and free-choice workflow nets. Inf. Syst. 47, 197\u2013219 (2015)","journal-title":"Inf. Syst."},{"key":"14_CR19","unstructured":"Hopcroft, J.E., Ullman, J.D.: An n log n algorithm for detecting reducible graphs. In: Proceedings of 6th Annual Princeton Conference on Information Sciences and Systems, pp. 119\u2013122 (1972)"},{"issue":"6","key":"14_CR20","doi-asserted-by":"publisher","first-page":"7029","DOI":"10.1016\/j.eswa.2010.12.012","volume":"38","author":"M La Rosa","year":"2011","unstructured":"La Rosa, M., Reijers, H.A., Van Der Aalst, W.M., Dijkman, R.M., Mendling, J., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Apromore: an advanced process model repository. Expert Syst. Appl. 38(6), 7029\u20137040 (2011)","journal-title":"Expert Syst. Appl."},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-07734-5_6","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"SJJ Leemans","year":"2014","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from incomplete event logs. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 91\u2013110. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-07734-5_6"},{"key":"14_CR22","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-030-37453-2_19","volume-title":"Business Process Management Workshops","author":"LL Mannel","year":"2019","unstructured":"Mannel, L.L., van der Aalst, W.M.P.: Finding uniwired petri nets using eST-miner. In: Di Francescomarino, C., Dijkman, R., Zdun, U. (eds.) BPM 2019. LNBIP, vol. 362, pp. 224\u2013237. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-37453-2_19"},{"key":"14_CR23","unstructured":"Mitsyuk, A., Lomazova, I., Shugurov, I., van der Aalst, W.: Process model repair by detecting unfitting fragments. In: AIST 2017, pp. 301\u2013313. CEUR Workshop Proceedings (2017)"},{"key":"14_CR24","unstructured":"OMG: Business Process Model and Notation (BPMN), Version 2.0.2, December 2013. \nhttp:\/\/www.omg.org\/spec\/BPMN\/2.0.2"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Polyvyanyy, A., Aalst, W.M.P.V.D., Hofstede, A.H.M.T., Wynn, M.T.: Impact-driven process model repair. ACM Trans. Softw. Eng. Methodol. 25(4) (2016). \nhttps:\/\/doi.org\/10.1145\/2980764","DOI":"10.1145\/2980764"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Solti, A., Weidlich, M., Di Ciccio, C., Mendling, J.: Monotone precision and recall for comparing executions and specifications of dynamic systems. ACM Trans. Softw. Eng. Methodol. (TOSEM) (2020). \nhttps:\/\/doi.org\/http:\/\/dx.doi.org\/10.1145\/3387909, in press","DOI":"10.1145\/3387909"},{"key":"14_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-69968-9","volume-title":"Petri Nets: An Introduction","author":"W Reisig","year":"1985","unstructured":"Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985). \nhttps:\/\/doi.org\/10.1007\/978-3-642-69968-9"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-91268-4_6","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"U Schlachter","year":"2018","unstructured":"Schlachter, U., Wimmel, H.: A geometric characterisation of event\/state separation. In: Khomenko, V., Roux, O.H. (eds.) PETRI NETS 2018. LNCS, vol. 10877, pp. 99\u2013116. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-91268-4_6"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-13675-7_14","volume-title":"Applications and Theory of Petri Nets","author":"M Sol\u00e9","year":"2010","unstructured":"Sol\u00e9, M., Carmona, J.: Process mining from a basis of state regions. In: Lilius, J., Penczek, W. (eds.) PETRI NETS 2010. LNCS, vol. 6128, pp. 226\u2013245. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13675-7_14"},{"issue":"2","key":"14_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10618-007-0065-y","volume":"15","author":"L Wen","year":"2007","unstructured":"Wen, L., Aalst, W.M., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Min. Knowl. Discov. 15(2), 145\u2013180 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-540-68746-7_24","volume-title":"Applications and Theory of Petri Nets","author":"JMEM van der Werf","year":"2008","unstructured":"van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. In: van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol. 5062, pp. 368\u2013387. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68746-7_24"},{"issue":"5","key":"14_CR32","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00607-017-0582-5","volume":"100","author":"SJ van Zelst","year":"2017","unstructured":"van Zelst, S.J., van Dongen, B.F., van\u00a0der Aalst, W.M.P., Verbeek, H.M.W.: Discovering workflow nets using integer linear programming. Computing 100(5), 529\u2013556 (2017). \nhttps:\/\/doi.org\/10.1007\/s00607-017-0582-5","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51831-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T01:22:54Z","timestamp":1593480174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51831-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518301","9783030518318"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51831-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PETRI NETS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applications and Theory of Petri Nets and Concurrency","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf-2020.petrinet.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.89","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}