{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:03:18Z","timestamp":1774915398205,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030374525","type":"print"},{"value":"9783030374532","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37453-2_19","type":"book-chapter","created":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T23:03:04Z","timestamp":1578006184000},"page":"224-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding Uniwired Petri Nets Using eST-Miner"],"prefix":"10.1007","author":[{"given":"Lisa Luise","family":"Mannel","sequence":"first","affiliation":[]},{"given":"Wil M. P.","family":"van der Aalst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"issue":"2","key":"19_CR1","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., 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":"19_CR2","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":"19_CR3","series-title":"Text 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. Text in Theoretical Computer Science, an EATCS Series. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47967-4"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Lorenz, R., Mauser, S., Juh\u00e1s, G.: How to synthesize nets from languages: a survey. In: Proceedings of the 39th Conference on Winter Simulation: 40 Years! The Best is Yet to Come, WSC 2007. IEEE Press (2007)","DOI":"10.1109\/WSC.2007.4419657"},{"key":"19_CR5","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). https:\/\/doi.org\/10.1007\/978-3-540-68746-7_24"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-23063-4_10","volume-title":"Business Process Management","author":"SJ van Zelst","year":"2015","unstructured":"van Zelst, S.J., van Dongen, B.F., van der Aalst, W.M.P.: Avoiding over-fitting in ILP-based process discovery. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 163\u2013171. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23063-4_10"},{"key":"19_CR7","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":"19_CR8","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.: Discovering the \u201cglue\u201d connecting activities - exploiting monotonicity to learn places faster. In: It\u2019s All About Coordination - Essays to Celebrate the Lifelong Scientific Achievements of Farhad Arbab (2018)","DOI":"10.1007\/978-3-319-90089-6_1"},{"issue":"9","key":"19_CR9","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W Aalst","year":"2004","unstructured":"Aalst, W., Weijters, A., 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":"19_CR10","unstructured":"Polato, M.: Dataset belonging to the help desk log of an Italian company (2017)"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Steeman, W.: BPI challenge 2013, incidents (2013). https:\/\/doi.org\/10.4121\/UUID:500573E6-ACCC-4B0C-9576-AA5468B10CEE","DOI":"10.4121\/UUID:500573E6-ACCC-4B0C-9576-AA5468B10CEE"},{"key":"19_CR12","unstructured":"Mannhardt, F.: Sepsis cases - event log (2016)"},{"key":"19_CR13","unstructured":"De Leoni, M., Mannhardt, F.: Road traffic fine management process (2015)"},{"key":"19_CR14","unstructured":"van der Aalst, W.M.P.: Event logs and models used in Process Mining: Data Science in Action (2016). http:\/\/www.processmining.org\/event_logs_and_models_used_in_book"}],"container-title":["Lecture Notes in Business Information Processing","Business Process Management Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37453-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T00:10:22Z","timestamp":1735863022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-37453-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374525","9783030374532"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37453-2_19","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Process Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bpm2019.ai.wu.ac.at\/","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":"115","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":"4","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":"20% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"In addition, 13 papers were published from the BPM forum and 60 from the BPM Workshops","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)"}}]}}