{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:02Z","timestamp":1742912282184,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066528"},{"type":"electronic","value":"9783031066535"}],"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-06653-5_2","type":"book-chapter","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T23:04:18Z","timestamp":1655075058000},"page":"23-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Unseen Behaviour from Event Logs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0628-2451","authenticated-orcid":false,"given":"Abel","family":"Armas Cervantes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3150-336X","authenticated-orcid":false,"given":"Farbod","family":"Taymouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3289181","volume":"19","author":"A Armas-Cervantes","year":"2019","unstructured":"Armas-Cervantes, A., Dumas, M., Rosa, M.L., Maaradji, A.: Local concurrency detection in business process event logs. ACM Trans. Internet Technol. 19(1), 1\u201323 (2019)","journal-title":"ACM Trans. Internet Technol."},{"doi-asserted-by":"crossref","unstructured":"Augusto, A., Conforti, R., Rosa, M.L., Dumas, M.: Split miner: discovering accurate and simple business process models from event logs. In: 2017 IEEE International Conference on Data Mining (ICDM), pp. 1\u201310 (2017)","key":"2_CR2","DOI":"10.1109\/ICDM.2017.9"},{"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 (2019)","key":"2_CR3","DOI":"10.1109\/ICPM.2019.00017"},{"issue":"1","key":"2_CR4","first-page":"187","volume":"95","author":"R Bergenthum","year":"2009","unstructured":"Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of petri nets from term based representations of infinite partial languages. Fundam. Inf. 95(1), 187\u2013217 (2009)","journal-title":"Fundam. Inf."},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004100011464","volume":"29","author":"G Birkhoff","year":"1933","unstructured":"Birkhoff, G.: On the combination of subalgebras. Math. Proc. Cambridge Philos. Soc. 29(4), 441\u2013464 (1933)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2016.2614680","volume":"29","author":"R Conforti","year":"2017","unstructured":"Conforti, R., Rosa, M.L., ter Hofstede, A.H.M.: Filtering out infrequent behavior from business process event logs. IEEE Trans. Knowl. Data Eng. 29(2), 300\u2013314 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-19488-2_2","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Dumas","year":"2015","unstructured":"Dumas, M., Garc\u00eda-Ba\u00f1uelos, L.: Process mining reloaded: event structures as a unified representation of process models and event logs. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 33\u201348. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19488-2_2"},{"key":"2_CR8","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-93931-5_9","volume-title":"Business Information Systems","author":"M Fani Sani","year":"2018","unstructured":"Fani Sani, M., van Zelst, S.J., van der Aalst, W.M.P.: Repairing outlier behaviour in event logs. In: Abramowicz, W., Paschke, A. (eds.) BIS 2018. LNBIP, vol. 320, pp. 115\u2013131. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93931-5_9"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/TSE.2017.2668418","volume":"44","author":"L Garc\u00eda-Ba\u00f1uelos","year":"2018","unstructured":"Garc\u00eda-Ba\u00f1uelos, L., van Beest, N.R.T.P., Dumas, M., Rosa, M.L., Mertens, W.: Complete and interpretable conformance checking of business processes. IEEE Trans. Softw. Eng. 44(3), 262\u2013290 (2018)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(95)00232-4","volume":"165","author":"M Habib","year":"1996","unstructured":"Habib, M., Nourine, L.: Tree structure for distributive lattices and its applications. Theoret. Comput. Sci. 165(2), 391\u2013405 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-38697-8_17","volume-title":"Application and Theory of Petri Nets and Concurrency","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.) PETRI NETS 2013. LNCS, vol. 7927, pp. 311\u2013329. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38697-8_17"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","volume":"13","author":"M Nielsen","year":"1981","unstructured":"Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, Part I. Theor. Comput. Sci. 13, 85\u2013108 (1981)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"2_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1109\/TSC.2018.2805912","volume":"14","author":"J Pei","year":"2021","unstructured":"Pei, J., Wen, L., Yang, H., Wang, J., Ye, X.: Estimating global completeness of event logs: a comparative study. IEEE Trans. Serv. Comput. 14(2), 441\u2013457 (2021)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-24953-7_4","volume-title":"Automated Technology for Verification and Analysis","author":"H Ponce-de-Le\u00f3n","year":"2015","unstructured":"Ponce-de-Le\u00f3n, H., Rodr\u00edguez, C., Carmona, J., Heljanko, K., Haar, S.: Unfolding-based process discovery. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 31\u201347. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_4"},{"key":"2_CR15","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)"},{"issue":"1","key":"2_CR16","first-page":"37","volume":"40","author":"MH Stone","year":"1936","unstructured":"Stone, M.H.: The theory of representation for boolean algebras. Trans. Am. Math. Soc. 40(1), 37\u2013111 (1936)","journal-title":"Trans. Am. Math. Soc."},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4","volume-title":"Process Mining: Data Science in Action","author":"W van der Aalst","year":"2016","unstructured":"van der Aalst, W.: Process Mining: Data Science in Action, 2nd edn. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49851-4","edition":"2"},{"issue":"9","key":"2_CR18","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."},{"issue":"1","key":"2_CR19","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)","journal-title":"Softw. Syst. Model."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.compind.2003.10.001","volume":"53","author":"WMP van der Aalst","year":"2004","unstructured":"van der Aalst, W.M.P., Weijters, A.J.M.M.: Process mining: a research agenda. Comput. Ind. 53(3), 231\u2013244 (2004)","journal-title":"Comput. Ind."},{"doi-asserted-by":"crossref","unstructured":"van Hee, K.M., Liu, Z., Sidorova, N.: Is my event log complete? - a probabilistic approach to process mining. In: International Conference on Research Challenges in Information Science, pp. 1\u201312 (2011)","key":"2_CR21","DOI":"10.1109\/RCIS.2011.6006848"},{"doi-asserted-by":"crossref","unstructured":"Wang, J., Song, S., Lin, X., Zhu, X., Pei, J.: Cleaning structured event logs: a graph repair approach. In: 2015 IEEE 31st International Conference on Data Engineering, pp. 30\u201341 (2015)","key":"2_CR22","DOI":"10.1109\/ICDE.2015.7113270"},{"unstructured":"Yang, H., Ter Hofstede, A.H., Van Dongen, B.F., Wynn, M.T., Wang, J.: On global completeness of event logs. BPM Center Report BPM-10-09 (2010)","key":"2_CR23"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets and Concurrency"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06653-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T23:05:02Z","timestamp":1655075102000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06653-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066528","9783031066535"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06653-5_2","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":"13 June 2022","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":"Bergen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"43","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2022.github.io\/","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":"35","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":"19","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":"54% - 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":"3","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)"}}]}}