{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:48:02Z","timestamp":1782373682449,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:00:00Z","timestamp":1782345600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T00:00:00Z","timestamp":1782345600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007210","name":"RWTH Aachen University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007210","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Process Sci"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Process mining provides techniques to analyse business processes based on digital execution track records, called event logs. A key step in that analysis is the construction of a process model that describes the workflow of the process. Process discovery algorithms automatically obtain these models from event logs. For any subsequent analysis it is important that the discovered model fits the behaviour of the log precisely, without overfitting the input data or using behaviorally unsound constructs. Achieving this goal under real-life circumstances with potentially incomplete and partially incorrect input logs remains challenging. State-of-the-art algorithms for this purpose typically rely on removing large parts of the process from the final model or utilize domain knowledge in the form of suitable input parameter choices. In this paper, we investigate if these two shortcomings of state-of-the-art process discovery techniques can be addressed without compromising on soundness guarantees and model quality. For this purpose, we introduce a new process discovery algorithm, called OptIMIIst, which extends the Inductive Miner framework for the recursive construction of sound process models with integer linear programs to optimize local mining decisions. Our evaluation demonstrates that OptIMIIst produces models with competitive quality profiles in comparison to other approaches with soundness guarantees without relying on excessive filtering or suitable parameter inputs.<\/jats:p>","DOI":"10.1007\/s44311-026-00051-x","type":"journal-article","created":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:04:02Z","timestamp":1782371042000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Locally optimized inductive process discovery"],"prefix":"10.1007","volume":"3","author":[{"given":"Calvin","family":"Schr\u00f6der","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan Niklas","family":"van Detten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sander J. J.","family":"Leemans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/S10257-014-0234-7","volume":"13","author":"A Adriansyah","year":"2015","unstructured":"Adriansyah A, Munoz-Gama J, Carmona J, van Dongen BF, van der Aalst WMP (2015) Measuring precision of modeled behavior. Inf Syst E-Bus Manage 13(1):37\u201367. https:\/\/doi.org\/10.1007\/S10257-014-0234-7","journal-title":"Inf Syst E-Bus Manage"},{"key":"51_CR2","doi-asserted-by":"publisher","unstructured":"Augusto A, Conforti R, Dumas M et al (2017) Split miner: discovering accurate and simple business process models from event logs. In 2017 IEEE International Conference on Data Mining (ICDM), pp 1\u201310). https:\/\/doi.org\/10.1109\/ICDM.2017.9","DOI":"10.1109\/ICDM.2017.9"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.datak.2018.04.007","volume":"117","author":"A Augusto","year":"2018","unstructured":"Augusto A, Conforti R, Dumas M, La Rosa M, Bruno G (2018) Automated discovery of structured process models from event logs: the discover-and-structure approach. Data Knowl Eng 117:373\u2013392. https:\/\/doi.org\/10.1016\/j.datak.2018.04.007 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0169023X18301708","journal-title":"Data Knowl Eng"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-72693-5_4","volume-title":"Process mining workshops","author":"A Augusto","year":"2021","unstructured":"Augusto A, Dumas M, La Rosa M (2021) Automated discovery of process models with true concurrency and inclusive choices. In: Leemans S, Leopold H (eds) Process mining workshops. Springer International Publishing, Cham, pp 43\u201356"},{"key":"51_CR5","doi-asserted-by":"publisher","unstructured":"Bergenthum R (2019) Prime miner - process discovery using prime event structures. In International Conference on Process Mining, ICPM 2019, IEEE, Aachen, Germany, 41\u201348). https:\/\/doi.org\/10.1109\/ICPM.2019.00017. June 24\u201326, 2019","DOI":"10.1109\/ICPM.2019.00017"},{"issue":"1\u20132","key":"51_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(95)00230-8","volume":"163","author":"SL Bloom","year":"1996","unstructured":"Bloom SL, \u00c9sik Z (1996) Free shuffle algebras in language varieties. Theor Comput Sci 163(1\u20132):55\u201398. https:\/\/doi.org\/10.1016\/0304-3975(95)00230-8","journal-title":"Theor Comput Sci"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1109\/ICPM53251.2021.9576864","volume-title":"3rd international conference on process mining, ICPM 2021","author":"D Brons","year":"2021","unstructured":"Brons D, Scheepens R, Fahland D (2021 October 31 - Nov. 4, 2021) Striking a new balance in accuracy and simplicity with the probabilistic inductive miner. In: Ciccio CD, Francescomarino CD, Soffer P (eds) 3rd international conference on process mining, ICPM 2021. IEEE, Eindhoven, The Netherlands, pp 32\u201339. https:\/\/doi.org\/10.1109\/ICPM53251.2021.9576864"},{"key":"51_CR8","doi-asserted-by":"publisher","unstructured":"Buijs J, van Dongen B, van der Aalst W (2012) A genetic algorithm for discovering process trees. In 2012 IEEE Congress on Evolutionary Computation, pp 1\u20138). https:\/\/doi.org\/10.1109\/CEC.2012.6256458","DOI":"10.1109\/CEC.2012.6256458"},{"key":"51_CR9","doi-asserted-by":"publisher","unstructured":"Dunzer S, Stierle M, Matzner M et al (2019) Conformance checking: a state-of-the-art literature review. In Proceedings of the 11th International Conference on Subject-Oriented Business Process Management. Association for Computing Machinery, New York, NY, USA, S-BPM ONE\u201919. https:\/\/doi.org\/10.1145\/3329007.3329014","DOI":"10.1145\/3329007.3329014"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Horv\u00e1th A, Ballarini P, Cry P. In: Gribaudo M, Iacono M, Sedigh Sarvestani S (eds) (2026) Probabilistic process discovery with stochastic process trees. In: Performance evaluation methodologies and tools. Springer Nature Switzerland, Cham, pp 47\u201368","DOI":"10.1007\/978-3-032-06818-7_3"},{"key":"51_CR11","doi-asserted-by":"publisher","unstructured":"Kourani H, van Zelst SJ (2023 September 11\u201315, 2023, Proceedings, Lecture Notes in Computer Science, vol POWL: partially ordered workflow language. In: Francescomarino CD, Burattin A, Janiesch C et al. (eds) Business Process Management - 21st International Conference, BPM 2023, vol 14159. Springer, Utrecht, The Netherlands, 92\u2013108). https:\/\/doi.org\/10.1007\/978-3-031-41620-0_6","DOI":"10.1007\/978-3-031-41620-0_6"},{"key":"51_CR12","unstructured":"K\u00fcsters A, van der Aalst WMP (2023) Revisiting the alpha algorithm to enable real-life process discovery applications. In: Gomes L, Leit\u00e3o P, Lorenz R et al. (eds) Joint Proceedings of the Workshop on Algorithms & Theories for the Analysis of Event Data and the International Workshop on Petri Nets for Twin Transition co-located with the 44th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2023), vol 3424. CEUR-WS.org, URL: Caparica, Portugal. https:\/\/ceur-ws.org\/Vol-3424\/paper4.pdf. June 25\u201330, 2023, CEUR Workshop Proceedings."},{"key":"51_CR13","doi-asserted-by":"publisher","unstructured":"Leemans SJJ (2022) Robust process mining with guarantees - process discovery, conformance checking and enhancement. In: Lecture notes in business information processing, vol 440. Springer. https:\/\/doi.org\/10.1007\/978-3-030-96655-3","DOI":"10.1007\/978-3-030-96655-3"},{"key":"51_CR14","doi-asserted-by":"publisher","unstructured":"Leemans SJJ, Fahland D, van der Aalst WMP (2013a) Discovering block-structured process models from event logs - a constructive approach. In: Colom JM, Desel J (eds) Application and Theory of Petri Nets and Concurrency - 34th International Conference, PETRI NETS 2013, vol 7927. Springer, Milan, Italy, 311\u2013329). https:\/\/doi.org\/10.1007\/978-3-642-38697-8_17. June 24\u201328, 2013. Proceedings, Lecture Notes in Computer Science","DOI":"10.1007\/978-3-642-38697-8_17"},{"key":"51_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-06257-0_6","volume-title":"Business process management workshops - BPM 2013 international workshops","author":"SJJ Leemans","year":"2013","unstructured":"Leemans SJJ, Fahland D, van der Aalst WMP (2013b Revised Papers, Lecture Notes in Business Information Processing, vol 171) Discovering block-structured process models from event logs containing infrequent behaviour. In: Lohmann N, Song M, Wohed P (eds) Business process management workshops - BPM 2013 international workshops. Springer, Beijing, China, pp 66\u201378. https:\/\/doi.org\/10.1007\/978-3-319-06257-0_6. August 26, 2013"},{"key":"51_CR16","doi-asserted-by":"publisher","unstructured":"Leemans SJJ, Fahland D, van der Aalst WMP (2014) Discovering block-structured process models from incomplete event logs. In: Ciardo G, Kindler E (eds) Application and Theory of Petri Nets and Concurrency - 35th International Conference, PETRI NETS 2014, vol 8489. Springer, Tunis, Tunisia, 91\u2013110). https:\/\/doi.org\/10.1007\/978-3-319-07734-5_6. June 23\u201327, 2014. Proceedings, Lecture Notes in Computer Science","DOI":"10.1007\/978-3-319-07734-5_6"},{"key":"51_CR17","doi-asserted-by":"publisher","unstructured":"Leemans SJJ, Tax N, Ter Hofstede AHM (2018) Indulpet miner: combining discovery algorithms. In: Panetto H, Debruyne C, Proper HA et al. (eds) On the Move to Meaningful Internet Systems. OTM 2018 Conferences - Confederated International Conferences: CoopIS, C&TC, and ODBASE 2018, vol Proceedings, Part I, vol 11229, Lecture Notes in Computer Science, vol Springer, Valletta, Malta, 97\u2013115). https:\/\/doi.org\/10.1007\/978-3-030-02610-3_6. October 22\u201326, 2018","DOI":"10.1007\/978-3-030-02610-3_6"},{"issue":"6","key":"51_CR18","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"JDC Little","year":"1963","unstructured":"Little JDC, Murty KG, Sweeney DW, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11(6):972\u2013989. https:\/\/doi.org\/10.1287\/opre.11.6.972","journal-title":"Oper Res"},{"key":"51_CR19","doi-asserted-by":"publisher","unstructured":"Mannel LL, van der Aalst WMP (2019 Proceedings, Lecture Notes in Computer Science) Finding complex process-structures by exploiting the token-game. In: Donatelli S, Haar S (eds) Application and Theory of Petri Nets and Concurrency - 40th International Conference, PETRI NETS 2019, vol 11522. Springer, Aachen, Germany, 258\u2013278). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_15. June 23\u201328, 2019","DOI":"10.1007\/978-3-030-21571-2_15"},{"issue":"4","key":"51_CR20","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata T (1989) Petri nets: properties, analysis and applications. Proc. IEEE 77(4):541\u2013580. https:\/\/doi.org\/10.1109\/5.24143","journal-title":"Proc. IEEE"},{"key":"51_CR21","doi-asserted-by":"publisher","unstructured":"Rehse JR, Leemans S, Fettke P et al (2024) On process discovery experimentation. ACM Trans Softw Eng Methodol. https:\/\/doi.org\/10.1145\/3672447","DOI":"10.1145\/3672447"},{"key":"51_CR22","doi-asserted-by":"publisher","unstructured":"Sani MF, van Zelst SJ, van der Aalst WMP (2019) Repairing outlier behaviour in event logs using contextual behaviour. Enterp Model Inf Syst Archit Int J Concept Model (14:5:1\u20135):24. https:\/\/doi.org\/10.18417\/EMISA.14.5","DOI":"10.18417\/EMISA.14.5"},{"key":"51_CR23","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-031-82225-4_29","volume-title":"Process mining workshops","author":"C Schr\u00f6der","year":"2025","unstructured":"Schr\u00f6der C, van Detten JN, Leemans SJJ (2025) Locally optimized process tree discovery. In: Delgado A, Slaats T (eds) Process mining workshops. Springer Nature Switzerland, Cham, pp 389\u2013401"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Sol\u00e9 M, Carmona J (2010) Process mining from a basis of state regions. In Applications and Theory of Petri Nets: 31st International Conference, PETRI NETS 2010, vol 31. Springer, Braga, Portugal, 226\u2013245). June 21\u201325, 2010. Proceedings","DOI":"10.1007\/978-3-642-13675-7_14"},{"issue":"4","key":"51_CR25","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/S10270-016-0536-Y","volume":"17","author":"M Sol\u00e9","year":"2018","unstructured":"Sol\u00e9 M, Carmona J (2018) Encoding process discovery problems in SMT. Softw Syst Model 17(4):1055\u20131078. https:\/\/doi.org\/10.1007\/S10270-016-0536-Y","journal-title":"Softw Syst Model"},{"key":"51_CR26","doi-asserted-by":"publisher","unstructured":"Sommers D, Menkovski V, Fahland D (2021 October 31 - Nov. 4, 2021) Process discovery using graph neural networks. In: Ciccio CD, Francescomarino CD, Soffer P (eds) 3rd International Conference on Process Mining, ICPM 2021, IEEE, Eindhoven, The Netherlands, 40\u201347). https:\/\/doi.org\/10.1109\/ICPM53251.2021.9576849","DOI":"10.1109\/ICPM53251.2021.9576849"},{"key":"51_CR27","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.is.2016.07.011","volume":"64","author":"S Suriadi","year":"2017","unstructured":"Suriadi S, Andrews R, Ter Hofstede A, Wynn MT (2017) Event log imperfection patterns for process mining: towards a systematic approach to cleaning event logs. Inf Syst 64:132\u2013150. https:\/\/doi.org\/10.1016\/j.is.2016.07.011 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0306437915301344","journal-title":"Inf Syst"},{"issue":"2","key":"51_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.jides.2016.11.001","volume":"3","author":"N Tax","year":"2016","unstructured":"Tax N, Sidorova N, Haakma R, van der Aalst WMP (2016) Mining local process models. J Educ Chang Innov Digit Ecosystems 3(2):183\u2013196. https:\/\/doi.org\/10.1016\/j.jides.2016.11.001 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2352664516300232","journal-title":"J Educ Chang Innov Digit Ecosystems"},{"key":"51_CR29","doi-asserted-by":"publisher","unstructured":"van der Aalst W, Weijters T, Maruster L, van der Aalst W (2004) Workflow mining: discovering process models from event logs. IEEE Trans Knowl Data Eng 16(9):1128\u20131142. https:\/\/doi.org\/10.1109\/TKDE.2004.47","DOI":"10.1109\/TKDE.2004.47"},{"key":"51_CR30","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.procs.2019.12.189","volume":"164","author":"van der Aalst Wmp","year":"2019","unstructured":"van der Aalst Wmp, van der Aalst WMP (2019) A practitioner\u2019s guide to process mining: limitations of the directly-follows graph. Proc Comp Sci 164:321\u2013328. https:\/\/doi.org\/10.1016\/j.procs.2019.12.189https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1877050919322367, cENTERIS 2019 - International Conference on ENTERprise Information Systems \/ ProjMAN 2019 - International Conference on Project MANagement \/ HCist 2019 - International Conference on Health and Social Care Information Systems and Technologies, CENTERIS\/ProjMAN\/HCist 2019","journal-title":"Proc Comp Sci"},{"issue":"3","key":"51_CR31","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"van der Aalst Wmp","year":"2011","unstructured":"van der Aalst Wmp, van Hee Km, Ter Hofstede Ahm, van der Aalst WMP, van Hee KM, Ter Hofstede AHM, Sidorova N, Verbeek HMW, Voorhoeve M, Wynn MT (2011) Soundness of workflow nets: classification, decidability, and analysis. Form. Asp. Comput 23(3):333\u2013363. https:\/\/doi.org\/10.1007\/s00165-010-0161-4","journal-title":"Form. Asp. Comput"},{"issue":"3\u20134","key":"51_CR32","doi-asserted-by":"publisher","first-page":"387","DOI":"10.3233\/FI-2009-136","volume":"94","author":"van der Werf Jmem","year":"2009","unstructured":"van der Werf Jmem, van Dongen Bf, Hurkens CAJ, van DerWerf JMEM, van Dongen BF, Serebrenik A (2009) Process discovery using integer linear programming. Fundam Inf 94(3\u20134):387\u2013412. https:\/\/doi.org\/10.3233\/FI-2009-136","journal-title":"Fundam Inf"},{"key":"51_CR33","doi-asserted-by":"publisher","unstructured":"van Detten Jn, Schumacher P, Leemans SJJ (2023) An approximate inductive miner. In 5th International Conference on Process Mining, ICPM 2023, IEEE, Rome, Italy, 129\u2013136). https:\/\/doi.org\/10.1109\/ICPM60904.2023.10271971. October 23\u201327, 2023","DOI":"10.1109\/ICPM60904.2023.10271971"},{"key":"51_CR34","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-59536-8_7","volume-title":"Advanced information Systems engineering - 29th international conference, CAiSE 2017","author":"van Dongen Bf","year":"2017","unstructured":"van Dongen Bf, Carmona J, Chatain T et al (2017) Aligning modeled and observed behavior: a compromise between computation complexity and quality. In: Dubois E, Pohl K (eds) Advanced information Systems engineering - 29th international conference, CAiSE 2017, vol 10253. Springer, Essen, Germany, June 12-16, 2017, Proceedings, Lecture Notes in Computer Science, vol pp 94\u2013109. https:\/\/doi.org\/10.1007\/978-3-319-59536-8_7"},{"key":"51_CR35","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.dss.2017.04.005","volume":"100","author":"Vanden Broucke Sk","year":"2017","unstructured":"Vanden Broucke Sk, De Weerdt J, Vanden Broucke SKLM (2017) Fodina: a robust and flexible heuristic process discovery technique. Decis Support Syst 100:109\u2013118. https:\/\/doi.org\/10.1016\/j.dss.2017.04.005 https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167923617300647 smart Business Process Management","journal-title":"Decis Support Syst"},{"key":"51_CR36","doi-asserted-by":"publisher","DOI":"10.4121\/3cfcdbb7-c909-4f60-8bec-62c780598047.v1","volume-title":"Process discovery contest 2024","author":"E Verbeek","year":"2024","unstructured":"Verbeek E (2024) Process discovery contest 2024. https:\/\/doi.org\/10.4121\/3cfcdbb7-c909-4f60-8bec-62c780598047.v1"},{"key":"51_CR37","unstructured":"Weijters AJMM, van der Aalst WMP, Alves de Medeiros AK (2006) Process mining with the heuristics miner-algorithm. Technische Universiteit Eindhoven. Eindhoven University of Technology, Eindhoven, https:\/\/publications.rwth-aachen.de\/record\/714920"}],"container-title":["Process Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-026-00051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44311-026-00051-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-026-00051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T07:04:14Z","timestamp":1782371054000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44311-026-00051-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":37,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s44311-026-00051-x","relation":{},"ISSN":["2948-2178"],"issn-type":[{"value":"2948-2178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]},"assertion":[{"value":"31 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"18"}}