{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T00:08:25Z","timestamp":1774915705325,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031336195","type":"print"},{"value":"9783031336201","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33620-1_3","type":"book-chapter","created":{"date-parts":[[2023,5,27]],"date-time":"2023-05-27T08:02:05Z","timestamp":1685174525000},"page":"37-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["There and\u00a0Back Again"],"prefix":"10.1007","author":[{"given":"Dani\u00ebl","family":"Barenholz","sequence":"first","affiliation":[]},{"given":"Marco","family":"Montali","sequence":"additional","affiliation":[]},{"given":"Artem","family":"Polyvyanyy","sequence":"additional","affiliation":[]},{"given":"Hajo A.","family":"Reijers","sequence":"additional","affiliation":[]},{"given":"Andrey","family":"Rivkin","sequence":"additional","affiliation":[]},{"given":"Jan Martijn E. M.","family":"van der Werf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,28]]},"reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-45594-9_11","volume-title":"Business Process Management","author":"WMP Aalst","year":"2000","unstructured":"Aalst, W.M.P.: Workflow verification: finding control-flow errors using petri-net-based techniques. In: van der Aalst, W., Desel, J., Oberweis, A. (eds.) Business Process Management. LNCS, vol. 1806, pp. 161\u2013183. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45594-9_11"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/3-540-63139-9_48","volume-title":"Application and Theory of Petri Nets 1997","author":"WMP Aalst","year":"1997","unstructured":"Aalst, W.M.P.: Verification of workflow nets. In: Az\u00e9ma, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol. 1248, pp. 407\u2013426. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63139-9_48"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-30446-1_1","volume-title":"Software Engineering and Formal Methods","author":"WMP Aalst","year":"2019","unstructured":"Aalst, W.M.P.: Object-centric process mining: dealing with divergence and convergence in event data. In: \u00d6lveczky, P.C., Sala\u00fcn, G. (eds.) SEFM 2019. LNCS, vol. 11724, pp. 3\u201325. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30446-1_1"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"van der Aalst, W.M.P.: Foundations of process discovery. In: van der Aalst, W.M.P., Carmona, J. (eds.) Process Mining Handbook. LNBIP, vol. 448, pp. 37\u201375. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-08848-3_2","DOI":"10.1007\/978-3-031-08848-3_2"},{"issue":"175","key":"3_CR5","first-page":"1","volume":"1\u20134","author":"WMP van der Aalst","year":"2020","unstructured":"van der Aalst, W.M.P., Berti, A.: Discovering object-centric petri nets. Fund. Inform. 1\u20134(175), 1\u201340 (2020)","journal-title":"Fund. Inform."},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"WMP van der Aalst","year":"2011","unstructured":"van der Aalst, W.M.P., et al.: Soundness of workflow nets: classification, decidability, and analysis. Formal Asp. Comput. 23(3), 333\u2013363 (2011)","journal-title":"Formal Asp. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Adams, J.N., Park, G., Levich, S., Schuster, D., van der Aalst, W.M.P.: A framework for extracting and encoding features from object-centric event data. In: Troya, J., Medjahed, B., Piattini, M., Yao, L., Fern\u00e1indez, P., Ruiz-Cort\u00e9s, A. (eds.) ICSOC 2022. LNCS, vol. 13740, pp. 36\u201353. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20984-0_3","DOI":"10.1007\/978-3-031-20984-0_3"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Barenholz, D., Montali, M., Polyvyanyy, A., Reijers, H.A., Rivkin, A., van der Werf, J.M.E.M.: On the reconstructability and rediscoverability of typed Jackson nets (extended version) (2023). https:\/\/doi.org\/10.48550\/ARXIV.2303.10039, https:\/\/arxiv.org\/abs\/2303.10039","DOI":"10.48550\/ARXIV.2303.10039"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Berti, A., van der Aalst, W.M.P.: OC-PM: analyzing object-centric event logs and process models. Int. J. Softw. Tools Technol. Transf. (2022). https:\/\/doi.org\/10.1007\/s10009-022-00668-w","DOI":"10.1007\/s10009-022-00668-w"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Best, E., Devillers, R., Koutny, M.: The box algebra=petri nets+process expressions. Inf. Comput. 178(1), 44\u2013100 (2002). https:\/\/doi.org\/10.1006\/inco.2002.3117","DOI":"10.1006\/inco.2002.3117"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-21571-2_1","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"D Fahland","year":"2019","unstructured":"Fahland, D.: Describing behavior of processes with many-to-many interactions. In: Donatelli, S., Haar, S. (eds.) PETRI NETS 2019. LNCS, vol. 11522, pp. 3\u201324. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21571-2_1"},{"key":"3_CR12","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-030-85082-1_16","volume-title":"New Trends in Database and Information Systems","author":"AF Ghahfarokhi","year":"2021","unstructured":"Ghahfarokhi, A.F., Park, G., Berti, A., van der Aalst, W.M.P.: OCEL: a standard for object-centric event logs. In: Bellatreche, L., et al. (eds.) ADBIS 2021. CCIS, vol. 1450, pp. 169\u2013175. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85082-1_16"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-57208-2_6","volume-title":"CONCUR\u201993","author":"RJ Glabbeek","year":"1993","unstructured":"Glabbeek, R.J.: The linear time\u2014branching time spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66\u201381. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_6"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"van Hee, K.M., Hidders, J., Houben, G.J., Paredaens, J., Thiran, P.: On the relationship between workflow models and document types. Inf. Syst. 34(1), 178\u2013208 (2009). https:\/\/doi.org\/10.1016\/j.is.2008.06.003","DOI":"10.1016\/j.is.2008.06.003"},{"issue":"1","key":"3_CR15","first-page":"3","volume":"4","author":"O Kopp","year":"2009","unstructured":"Kopp, O., Martin, D., Wutke, D., Leyman, F.: The difference between graph-based and block-structured business process modelling languages. EMISAJ 4(1), 3\u201313 (2009)","journal-title":"EMISAJ"},{"key":"3_CR16","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"},{"issue":"6","key":"3_CR17","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TSC.2015.2474358","volume":"8","author":"X Lu","year":"2015","unstructured":"Lu, X., Nagelkerke, M., van de Wiel, D., Fahland, D.: Discovering interacting artifacts from ERP systems. IEEE Trans. Serv. Comput. 8(6), 861\u2013873 (2015)","journal-title":"IEEE Trans. Serv. Comput."},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989). https:\/\/doi.org\/10.1109\/5.24143","DOI":"10.1109\/5.24143"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-030-21290-2_13","volume-title":"Advanced Information Systems Engineering","author":"A Polyvyanyy","year":"2019","unstructured":"Polyvyanyy, A., van der Werf, J.M.E.M., Overbeek, S., Brouwers, R.: Information systems modeling: language, verification, and tool support. In: Giorgini, P., Weber, B. (eds.) CAiSE 2019. LNCS, vol. 11483, pp. 194\u2013212. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21290-2_13"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"99480","DOI":"10.1109\/ACCESS.2021.3095464","volume":"9","author":"A Tour","year":"2021","unstructured":"Tour, A., Polyvyanyy, A., Kalenkova, A.A.: Agent system mining: vision, benefits, and challenges. IEEE Access 9, 99480\u201399494 (2021)","journal-title":"IEEE Access"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Tour, A., Polyvyanyy, A., Kalenkova, A.A., Senderovich, A.: Agent miner: an algorithm for discovering agent systems from event data. CoRR abs\/2212.01454 (2022)","DOI":"10.1007\/978-3-031-41620-0_17"},{"issue":"9","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W van der Aalst","year":"2004","unstructured":"van der Aalst, W., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. Knowl. Data Eng. 16(9), 1128\u20131142 (2004)","journal-title":"Knowl. Data Eng."},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"van der Werf, J.M.E.M., Rivkin, A., Polyvyanyy, A., Montali, M.: Data and process resonance. In: Bernardinello, L., Petrucci, L. (eds.) PETRI NETS 2022. LNCS, vol. 13288, pp. 369\u2013392. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06653-5_19","DOI":"10.1007\/978-3-031-06653-5_19"}],"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-33620-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T05:16:34Z","timestamp":1702530994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33620-1_3"}},"subtitle":["On the Reconstructability and Rediscoverability of Typed Jackson Nets"],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031336195","9783031336201"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33620-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 May 2023","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/petrinets2023.deec.fct.unl.pt\/","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":"47","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":"21","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":"45% - 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":"4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}