{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T11:29:24Z","timestamp":1746012564787,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030634605"},{"type":"electronic","value":"9783030634612"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-63461-2_22","type":"book-chapter","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T16:03:28Z","timestamp":1605283408000},"page":"397-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["PALM: A Technique for Process ALgebraic Specification Mining"],"prefix":"10.1007","author":[{"given":"Sara","family":"Belluccini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocco","family":"De Nicola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Tiezzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,13]]},"reference":[{"key":"22_CR1","unstructured":"4tu. https:\/\/data.4tu.nl\/repository\/collection:event_logs_real"},{"key":"22_CR2","unstructured":"PALM github repository. https:\/\/github.com\/SaraBellucciniIMT\/PALM"},{"key":"22_CR3","first-page":"1128","volume":"9","author":"W Van der Aalst","year":"2004","unstructured":"Van der Aalst, W., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. TKDE 9, 1128\u20131142 (2004)","journal-title":"TKDE"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-49851-4_1","volume-title":"Process Mining","author":"W Aalst","year":"2016","unstructured":"Aalst, W.: Data science in action. Process Mining, pp. 3\u201323. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49851-4_1"},{"key":"22_CR5","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-28108-2_19","volume-title":"Business Process Management Workshops","author":"W van der Aalst","year":"2012","unstructured":"van der Aalst, W., et al.: Process mining manifesto. In: Daniel, F., Barkaoui, K., Dustdar, S. (eds.) BPM 2011. LNBIP, vol. 99, pp. 169\u2013194. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28108-2_19"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010 - Concurrency Theory","author":"F Aarts","year":"2010","unstructured":"Aarts, F., Vaandrager, F.: Learning I\/O automata. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 71\u201385. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15375-4_6"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Augusto, A., Conforti, R., Dumas, M., La Rosa, M.: Split miner: discovering accurate and simple business process models from event logs (2017)","DOI":"10.1109\/ICDM.2017.9"},{"key":"22_CR9","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.: Automated discovery of structured process models from event logs. DKE 117, 373\u2013392 (2018)","journal-title":"DKE"},{"key":"22_CR10","unstructured":"Augusto, A., et al.: Automated discovery of process models from event logs: review and benchmark. TKDE (2018)"},{"key":"22_CR11","unstructured":"Belluccini, S., De Nicola, R., Re, B., Tiezzi, F.: PALM: a technique for process algebraic specification mining (technical report). Technical report, IMT. https:\/\/github.com\/SaraBellucciniIMT\/PALM"},{"issue":"1\/3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"JA Bergstra","year":"1984","unstructured":"Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control 60(1\/3), 109\u2013137 (1984)","journal-title":"Inf. Control"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Beschastnikh, I., et al.: Inferring models of concurrent systems from logs of their behavior with CSight. In: ICSE, pp. 468\u2013479. IEEE (2014)","DOI":"10.1145\/2568225.2568246"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-33606-5_19","volume-title":"On the Move to Meaningful Internet Systems: OTM 2012","author":"JCAM Buijs","year":"2012","unstructured":"Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: On the role of fitness, precision, generalization and simplicity in process discovery. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7565, pp. 305\u2013322. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33606-5_19"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-030-17465-1_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"O Bunte","year":"2019","unstructured":"Bunte, O., et al.: The mCRL2 toolset for analysing concurrent systems. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11428, pp. 21\u201339. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17465-1_2"},{"key":"22_CR16","unstructured":"Burattin, A.: PLG2: Multiperspective process randomization with online and offline simulations. In: BPM (Demos), pp. 1\u20136 (2016)"},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/287000.287001","volume":"7","author":"JE Cook","year":"1998","unstructured":"Cook, J.E., Wolf, A.L.: Discovering models of software processes from event-based data. ACM TOSEM 7(3), 215\u2013249 (1998)","journal-title":"ACM TOSEM"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Fu, Q., at al.: Contextual analysis of program logs for understanding system behaviors. In: MSR, pp. 397\u2013400. IEEE (2013)","DOI":"10.1109\/MSR.2013.6624054"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Mousavi, M.: Modelling and analysis of communicating systems. Technische Universiteit Eindhoven (2013)","DOI":"10.7551\/mitpress\/9946.001.0001"},{"key":"22_CR20","unstructured":"G\u00fcnther, C.W., Verbeek, E.: XES standard definition. Fluxicon Lab (2014)"},{"key":"22_CR21","unstructured":"Hammerschmidt, C.A., State, R., Verwer, S.: Human in the loop: interactive passive automata learning via evidence-driven state-merging algorithms. arXiv preprint arXiv:1707.09430 (2017)"},{"key":"22_CR22","unstructured":"Hammerschmidt, C.A., Verwer, S., Lin, Q., State, R.: Interpreting finite automata for sequential data. arXiv preprint arXiv:1611.07100 (2016)"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-45237-7_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"DN Jansen","year":"2020","unstructured":"Jansen, D.N., Groote, J.F., Keiren, J.J.A., Wijs, A.: An O(m\u00a0log\u00a0n) algorithm for branching bisimilarity on labelled transition systems. TACAS 2020. LNCS, vol. 12079, pp. 3\u201320. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45237-7_1"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, S., Khoo, S.C., Roychoudhury, A., Lo, D.: Mining message sequence graphs. In: ICSE, pp. 91\u2013100 (2011)","DOI":"10.1145\/1985793.1985807"},{"key":"22_CR26","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":"22_CR27","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hal (1989)"},{"key":"22_CR28","unstructured":"Murphy, K.P., et al.: Passively learning finite automata. Santa Fe Institute (1995)"},{"issue":"3\u20134","key":"22_CR29","first-page":"361","volume":"50","author":"M Reniers","year":"2002","unstructured":"Reniers, M., Groote, J.F., van der Zwaag, M.B., van Wamel, J.: Completeness of timed $$\\mu $$crl. Fundamenta Informaticae 50(3\u20134), 361\u2013402 (2002)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR30","unstructured":"Rozinat, A., et al.: Towards an evaluation framework for process mining algorithms. BPM Center Report BPM-07-06 123, p. 142 (2007)"},{"issue":"3","key":"22_CR31","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.compind.2003.10.003","volume":"53","author":"G Schimm","year":"2004","unstructured":"Schimm, G.: Mining exact models of concurrent workflows. Comput. Ind. 53(3), 265\u2013281 (2004)","journal-title":"Comput. Ind."},{"key":"22_CR32","unstructured":"Shin, D., et al.: Scalable inference of system-level models from component logs. arXiv preprint arXiv:1908.02329 (2019)"},{"issue":"2","key":"22_CR33","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/2967606","volume":"60","author":"FW Vaandrager","year":"2017","unstructured":"Vaandrager, F.W.: Model learning. Commun. ACM 60(2), 86\u201395 (2017)","journal-title":"Commun. ACM"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11494744_25","volume-title":"Applications and Theory of Petri Nets 2005","author":"BF van Dongen","year":"2005","unstructured":"van Dongen, B.F., de Medeiros, A.K.A., Verbeek, H.M.W., Weijters, A.J.M.M., van der Aalst, W.M.P.: The ProM framework: a new era in process mining tool support. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol. 3536, pp. 444\u2013454. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11494744_25"},{"issue":"11","key":"22_CR35","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1093\/comjnl\/bxx040","volume":"60","author":"H Verbeek","year":"2017","unstructured":"Verbeek, H., van der Aalst, W.M., Munoz-Gama, J.: Divide and conquer: a tool framework for supporting decomposed discovery in process mining. Comput. J. 60(11), 1649\u20131674 (2017)","journal-title":"Comput. J."},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Verwer, S., Hammerschmidt, C.A.: Flexfringe: a passive automaton learning package. In: ICSME, pp. 638\u2013642. IEEE (2017)","DOI":"10.1109\/ICSME.2017.58"},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Weijters, A., Ribeiro, J.: Flexible heuristics miner. In: CIDM, pp. 310\u2013317. IEEE (2011)","DOI":"10.1109\/CIDM.2011.5949453"},{"issue":"5","key":"22_CR38","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00607-017-0582-5","volume":"100","author":"S van Zelst","year":"2018","unstructured":"van Zelst, S., van Dongen, B., van der Aalst, W., Verbeek, H.: Discovering workflow nets using integer linear programming. Computing 100(5), 529\u2013556 (2018)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Integrated Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-63461-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T16:38:43Z","timestamp":1605285523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-63461-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030634605","9783030634612"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-63461-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integrated Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lugano","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ifm2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifm20.si.usi.ch\/","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":"64","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":"24","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":"2","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":"38% - 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":"6,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)"}},{"value":"Due to the Corona pandemic this event was held virtually.","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)"}}]}}