{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:24:13Z","timestamp":1743038653071,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031156281"},{"type":"electronic","value":"9783031156298"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15629-8_29","type":"book-chapter","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:26:53Z","timestamp":1664036813000},"page":"539-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Directly-Follows Complete Petri Nets from\u00a0Event Data"],"prefix":"10.1007","author":[{"given":"Wil M. P.","family":"van der Aalst","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4_1","volume-title":"Process Mining: Data Science in Action","author":"WMP van der Aalst","year":"2016","unstructured":"van der Aalst, W.M.P.: Process Mining: Data Science in Action. Springer-Verlag, Berlin (2016). https:\/\/doi.org\/10.1007\/978-3-662-49851-4_1"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P.: A practitioner\u2019s guide to process mining: limitations of the directly-follows graph. In: International Conference on Enterprise Information Systems (Centeris 2019), volume 164 of Procedia Computer Science, pp. 321\u2013328. Elsevier (2019)","DOI":"10.1016\/j.procs.2019.12.189"},{"issue":"2","key":"29_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1002\/widm.1045","volume":"2","author":"WMP van der Aalst","year":"2012","unstructured":"van der Aalst, W.M.P., Adriansyah, A., van Dongen, B.: Replaying history on process models for conformance checking and performance analysis. WIREs Data Min. Knowl. Discovery 2(2), 182\u2013192 (2012)","journal-title":"WIREs Data Min. Knowl. Discovery"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10270-008-0106-z","volume":"9","author":"WMP van der Aalst","year":"2010","unstructured":"van der Aalst, W.M.P., Rubin, V., Verbeek, H.M.W., 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\u2013111 (2010). https:\/\/doi.org\/10.1007\/s10270-008-0106-z","journal-title":"Softw. Syst. Model."},{"issue":"9","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"WMP van der Aalst","year":"2004","unstructured":"van der Aalst, W.M.P., Weijters, A.J.M.M., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128\u20131142 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"29_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-32940-1_18","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Vaandrager, F.: A theory of history dependent abstractions for learning interface automata. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 240\u2013255. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_18"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D Angluin","year":"1983","unstructured":"Angluin, D., Smith, C.H.: Inductive inference: theory and methods. Comput. Surv. 15(3), 237\u2013269 (1983)","journal-title":"Comput. Surv."},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10115-018-1214-x","volume":"59","author":"A Augusto","year":"2019","unstructured":"Augusto, A., Conforti, R., Marlon, 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 (2019). https:\/\/doi.org\/10.1007\/s10115-018-1214-x","journal-title":"Knowl. Inf. Syst."},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-75183-0_27","volume-title":"Business Process Management","author":"R Bergenthum","year":"2007","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 375\u2013383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75183-0_27"},{"key":"29_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). https:\/\/doi.org\/10.1007\/978-3-540-85758-7_26"},{"key":"29_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99414-7","volume-title":"Conformance Checking: Relating Processes and Models","author":"J Carmona","year":"2018","unstructured":"Carmona, J., van Dongen, B., Solti, A., Weidlich, M.: Conformance Checking: Relating Processes and Models. Springer-Verlag, Berlin (2018). https:\/\/doi.org\/10.1007\/978-3-319-99414-7"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free Choice Petri Nets, volume\u00a040 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, UK (1995)","DOI":"10.1017\/CBO9780511526558"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-65306-6_15","volume-title":"Lectures on Petri Nets I: Basic Models","author":"J Desel","year":"1998","unstructured":"Desel, J., Reisig, W.: Place\/transition nets. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. Lecture Notes in Computer Science, vol. 1491, pp. 122\u2013173. Springer-Verlag, Berlin (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_15"},{"issue":"4","key":"29_CR15","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00264612","volume":"27","author":"A Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures - part 1 and part 2. Acta Informatica 27(4), 315\u2013368 (1989). https:\/\/doi.org\/10.1007\/BF00264612","journal-title":"Acta Informatica"},{"key":"29_CR16","unstructured":"Kerremans, M., Srivastava, T., Choudhary, F.: Gartner market guide for process mining, Research Note G00737056 (2021). https:\/\/www.gartner.com"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-642-38697-8_17","volume-title":"Applications and Theory of Petri Nets 2013","author":"SJJ Leemans","year":"2013","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs: a constructive approach. In: Colom, J.M., Desel, J. (eds.) Applications and Theory of Petri Nets 2013. Lecture Notes in Computer Science, vol. 7927, pp. 311\u2013329. Springer-Verlag, Berlin (2013)"},{"key":"29_CR18","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-06257-0_6","volume-title":"Business Process Management Workshops","author":"SJJ Leemans","year":"2014","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs containing infrequent behaviour. In: Lohmann, N., Song, M., Wohed, P. (eds.) BPM 2013. LNBIP, vol. 171, pp. 66\u201378. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06257-0_6"},{"issue":"2","key":"29_CR19","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s10270-016-0545-x","volume":"17","author":"SJJ Leemans","year":"2018","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Scalable process discovery and conformance checking. Softw. Syst. Model. 17(2), 599\u2013631 (2018). https:\/\/doi.org\/10.1007\/s10270-016-0545-x","journal-title":"Softw. Syst. Model."},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-030-21571-2_15","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"LL Mannel","year":"2019","unstructured":"Mannel, L.L., van der Aalst, W.M.P.: Finding complex process-structures by exploiting the token-game. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 258\u2013278. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_15"},{"key":"29_CR21","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). https:\/\/doi.org\/10.1007\/978-3-642-13675-7_14"},{"key":"29_CR22","doi-asserted-by":"publisher","unstructured":"Syring, Anja F., Tax, Niek, van der Aalst, W.M.P.: Evaluating conformance measures in process mining using conformance propositions. In: Koutny, Maciej, Pomello, Lucia, Kristensen, Lars Michael (eds.) Transactions on Petri Nets and Other Models of Concurrency XIV. LNCS, vol. 11790, pp. 192\u2013221. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-60651-3_8","DOI":"10.1007\/978-3-662-60651-3_8"},{"issue":"2","key":"29_CR23","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"F Vaandrager","year":"2002","unstructured":"Vaandrager, F.: Model learning. Commun. ACM 60(2), 86\u201395 (2002)","journal-title":"Commun. ACM"},{"issue":"2","key":"29_CR24","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10618-007-0065-y","volume":"15","author":"L Wen","year":"2007","unstructured":"Wen, L., van der Aalst, W.M.P., Wang, J., Sun, J.: Mining process models with non-free-choice constructs. Data Min. Knowl. Disc. 15(2), 145\u2013180 (2007)","journal-title":"Data Min. Knowl. Disc."},{"issue":"10","key":"29_CR25","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1016\/j.datak.2010.06.001","volume":"69","author":"L Wen","year":"2010","unstructured":"Wen, L., Wang, J., van der Aalst, W.M.P., Huang, B., Sun, J.: Mining process models with prime invisible tasks. Data Knowl. Eng. 69(10), 999\u20131021 (2010)","journal-title":"Data Knowl. Eng."},{"key":"29_CR26","first-page":"387","volume":"94","author":"JMEM van der Werf","year":"2010","unstructured":"van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. Fund. Inform. 94, 387\u2013412 (2010)","journal-title":"Fund. Inform."},{"issue":"5","key":"29_CR27","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). https:\/\/doi.org\/10.1007\/s00607-017-0582-5","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","A Journey from Process Algebra via Timed Automata to Model Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15629-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T16:32:07Z","timestamp":1664037127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15629-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031156281","9783031156298"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15629-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}