{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:59:23Z","timestamp":1781614763437,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T00:00:00Z","timestamp":1760918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004233","name":"Universitat Polit\u00e8cnica de Val\u00e8ncia","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004233","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Process mining encompasses a range of methods designed to analyze event logs. Among these methods, control-flow discovery algorithms are particularly significant, as they enable the identification of real-world process models, known as\n                    <jats:italic>in-vivo<\/jats:italic>\n                    processes, in contrast to anticipated models. An obstacle faced by control-flow discovery algorithms is their limited ability to recognize duplicated activities, which are activities that occur in multiple locations within a process. This issue is particularly relevant in the healthcare sector, where numerous instances of duplicated activities exist in processes but remain undetected by conventional algorithms. This article introduces a novel concept for a control-flow discovery algorithm capable of effectively revealing duplicated activities. The effectiveness of this technique is demonstrated through experimentation on a synthetic dataset. Moreover, the algorithm has been implemented and its source code is available as open-source software, accessible both as a ProM plugin and a Java Maven dependency.\n                  <\/jats:p>","DOI":"10.1007\/s10844-025-00997-7","type":"journal-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T01:57:51Z","timestamp":1760925471000},"page":"965-988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["I-PALIA, An algorithm for discovering BPMN processes with duplicated tasks"],"prefix":"10.1007","volume":"64","author":[{"given":"Carlos","family":"Fernandez-Llatas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Burattin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,20]]},"reference":[{"key":"997_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49851-4","volume-title":"Process mining","author":"WMP Aalst","year":"2016","unstructured":"Aalst, W. M. P. (2016). Process mining (2nd ed.). Springer. https:\/\/doi.org\/10.1007\/978-3-662-49851-4","edition":"2"},{"key":"997_CR2","unstructured":"Aalst, W. M., Rubin, V., Dongen, B. F., Kindler, E., & G\u00fcnther, C. W. (2006). Process mining: A two-step approach using transition systems and regions. BPM Center Report BPM-06-30, BPMcenter. org. 6."},{"key":"997_CR3","unstructured":"Aalst, W. M. P., Weijters, T. A. J. M. M., & Medeiros, A. K. A. (2006). Process mining with the heuristics miner-algorithm. BETA Working Paper Series, WP 166, Eindhoven University of Technology, Eindhoven."},{"issue":"1","key":"997_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1022883727209","volume":"14","author":"WMP Aalst","year":"2003","unstructured":"Aalst, W. M. P., Hofstede, A. H. M., Kiepuszewski, B., & Barros, A. P. (2003). Workflow patterns. Distributed and Parallel Databases, 14(1), 5\u201351. https:\/\/doi.org\/10.1023\/A:1022883727209","journal-title":"Distributed and Parallel Databases"},{"key":"997_CR5","doi-asserted-by":"crossref","unstructured":"Alkhammash, H., Polyvyanyy, A., & Moffat, A. (2024). Stochastic directly-follows process discovery using grammatical inference. In International conference on advanced information systems engineering (pp. 87\u2013103). Springer","DOI":"10.1007\/978-3-031-61057-8_6"},{"issue":"4","key":"997_CR6","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2018.2841877","volume":"31","author":"A Augusto","year":"2019","unstructured":"Augusto, A., Conforti, R., Dumas, M., Rosa, M., Maggi, F. M., Marrella, A., Mecella, M., & Soo, A. (2019). Automated discovery of process models from event logs: Review and benchmark. IEEE Transactions on Knowledge and Data Engineering, 31(4), 686\u2013705. https:\/\/doi.org\/10.1109\/TKDE.2018.2841877","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"997_CR7","unstructured":"Berti, A., & Aalst, W. M. P. (2019). Reviving token-based replay: Increasing speed while improving diagnostics. In Proceedings of ATAED@Petri Nets\/ACSD 2019 (pp. 87\u2013103). CEUR Workshop Proceedings."},{"issue":"01","key":"997_CR8","doi-asserted-by":"publisher","first-page":"1440001","DOI":"10.1142\/S0218843014400012","volume":"23","author":"JCAM Buijs","year":"2014","unstructured":"Buijs, J. C. A. M., Dongen, B. F., & Aalst, W. M. P. (2014). Quality dimensions in process discovery: The importance of fitness, precision, generalization and simplicity. International Journal of Cooperative Information Systems, 23(01), 1440001. https:\/\/doi.org\/10.1142\/S0218843014400012","journal-title":"International Journal of Cooperative Information Systems"},{"key":"997_CR9","unstructured":"Burattin, A. (2016). PLG2 : Multiperspective process randomization with online and offline simulations. In Online Proceedings of the BPM Demo Track 2016. CEUR-WS.org."},{"key":"997_CR10","doi-asserted-by":"crossref","unstructured":"Burattin, A., Re, B., Rossi, L., & Tiezzi, F. (2022). A purpose-guided log generation framework. In Proceedings of BPM 2022.","DOI":"10.1007\/978-3-031-16103-2_14"},{"key":"997_CR11","doi-asserted-by":"publisher","unstructured":"Calders, T., G\u00fcnther, C. W., Pechenizkiy, M., & Rozinat, A. (2009). Using minimum description length for process mining. In Proceedings of the 2009 ACM Symposium on Applied Computing - SAC \u201909 (pp. 1451\u20131455). ACM Press, New York, New York, USA. https:\/\/doi.org\/10.1145\/1529282.1529606. http:\/\/portal.acm.org\/citation.cfm?doid=1529282.1529606","DOI":"10.1145\/1529282.1529606"},{"key":"997_CR12","doi-asserted-by":"crossref","unstructured":"Daniel, F.,Barkaoui, K., & Dustdar, S. (2011). IEEE task force on process mining: Process mining manifesto. Business Process Management Workshops (pp. 169\u2013194). Springer,","DOI":"10.1007\/978-3-642-28115-0"},{"key":"997_CR13","doi-asserted-by":"crossref","unstructured":"Duan, C., & Wei, Q. (2020). Process mining of duplicate tasks: A systematic literature review. In 2020 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA) (pp. 778\u2013784). IEEE.","DOI":"10.1109\/ICAICA50127.2020.9182667"},{"key":"997_CR14","doi-asserted-by":"crossref","unstructured":"Fernandez-Llatas, C., & Burattin, A. (2023). I-PALIA: Discovering BPMN processes with duplicated activities for healthcare domains. In Proceedings of the International workshop on process-oriented data science for healthcare (PODS4H23).","DOI":"10.1007\/978-3-031-56107-8_19"},{"key":"997_CR15","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez-Llatas, C., Meneu, T., Bened\u00ed, J. M., & Traver, V. (2010). Activity-based process mining for clinical pathways computer aided design. In 2010 Annual International Conference of the IEEE Engineering in Medicine and Biology (pp. 6178\u20136181). https:\/\/doi.org\/10.1109\/IEMBS.2010.5627760","DOI":"10.1109\/IEMBS.2010.5627760"},{"key":"997_CR16","doi-asserted-by":"publisher","unstructured":"Fernandez-Llatas, C., Pileggi, S. F., Traver, V., & Benedi, J. M. (2011). Timed parallel automaton: A mathematical tool for defining highly expressive formal workflows. In 2011 Fifth asia modelling symposium (pp. 56\u201361). https:\/\/doi.org\/10.1109\/AMS.2011.22","DOI":"10.1109\/AMS.2011.22"},{"key":"997_CR17","first-page":"1305","volume":"10","author":"S Goedertier","year":"2009","unstructured":"Goedertier, S., Martens, D., Vanthienen, J., & Baesens, B. (2009). Robust process discovery with artificial negative events. The Journal of Machine Learning Research, 10, 1305\u20131340.","journal-title":"The Journal of Machine Learning Research"},{"key":"997_CR18","doi-asserted-by":"crossref","unstructured":"Ibanez-Sanchez, G., Fernandez-Llatas, C., Valero-Ramon, Z., & Bayo-Monton, J. L. (2023). Pmapp: An interactive process mining toolkit for building healthcare dashboards. In Explainable artificial intelligence and process mining applications for healthcare (pp. 75\u201386). Springer.","DOI":"10.1007\/978-3-031-54303-6_8"},{"key":"997_CR19","doi-asserted-by":"crossref","unstructured":"Leemans, S. J. J., Fahland, D., & Aalst, W. M. P. (2014a). Discovering block-structured process models from event logs containing infrequent behaviour. In Business process management workshops (pp 66\u201378).","DOI":"10.1007\/978-3-319-06257-0_6"},{"key":"997_CR20","unstructured":"Leemans, S. J., Fahland, D., & Van Der\u00a0Aalst, W. M. (2014b). Process and deviation exploration with inductive visual miner. In 12th International Conference on Business Process Management, BPM 2014 (pp. 46\u201350). CEUR-WS. org."},{"key":"997_CR21","doi-asserted-by":"crossref","unstructured":"Lu, X., Fahland, D., Biggelaar, F. J., & Aalst, W. M. (2016). Handling duplicated tasks in process discovery by refining event labels. In Business Process Management: 14th International Conference, BPM 2016, Rio de Janeiro, Brazil, September 18-22, 2016 (Proceedings 14, pp. 90\u2013107). Springer.","DOI":"10.1007\/978-3-319-45348-4_6"},{"key":"997_CR22","unstructured":"Mannhardt, F., & Blinde, D. (2017). Analyzing the trajectories of patients with sepsis using process mining. In RADAR+ EMISA 2017 (pp. 72\u201380). CEUR-ws.org."},{"key":"997_CR23","unstructured":"Medeiros, A. K. A. (2006). Genetic process mining. PhD thesis, Technische Universiteit Eindhoven."},{"key":"997_CR24","doi-asserted-by":"publisher","unstructured":"Munoz-Gama, J., Martin, N., Fernandez-Llatas, C., Johnson, O.A., Sep\u00falveda, M., Helm, E., Galvez-Yanjari, V., Rojas, E., Martinez-Millana, A., Aloini, D., Amantea, I.A., Andrews, R., Arias, M., Beerepoot, I., Benevento, E., Burattin, A., Capurro, D., Carmona, J., Comuzzi, M., . . . Zerbato, F. (2022). Process mining for healthcare: Characteristics and challenges. Journal of Biomedical Informatics, 127, 103994. https:\/\/doi.org\/10.1016\/j.jbi.2022.103994","DOI":"10.1016\/j.jbi.2022.103994"},{"key":"997_CR25","unstructured":"OMG (2009). Business Process Model and Notation (BPMN) - Version 2.0, Beta 1."},{"issue":"3","key":"997_CR26","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson, J. L. (1977). Petri nets. ACM Computing Surveys (CSUR), 9(3), 223\u2013252. https:\/\/doi.org\/10.1145\/356698.356702","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"997_CR27","unstructured":"Rojas, E., Fern\u00e1ndez-Llatas, C., Traver, V., Munoz-Gama, J., Sep\u00falveda, M., Herskovic, V., & Capurro, D. (2017). Palia-er: Bringing question-driven process mining closer to the emergency room. In 15th International Conference on Business Process Management (BPM 2017)."},{"key":"997_CR28","unstructured":"Russell, N., Hofstede, A. H. M., Aalst, W. M. P., & Mulyar, N. (2006). Workflow control-flow patterns: A revised view. BPM Center Report BPM-06-22, BPMcenter. org."},{"issue":"1","key":"997_CR29","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0164-1212(94)90112-0","volume":"27","author":"PD Stotts","year":"1994","unstructured":"Stotts, P. D., & Pugh, W. (1994). Parallel finite automata for modeling concurrent software systems. Journal of Systems and Software, 27(1), 27\u201343.","journal-title":"Journal of Systems and Software"},{"key":"997_CR30","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ins.2016.09.008","volume":"373","author":"B V\u00e1zquez-Barreiros","year":"2016","unstructured":"V\u00e1zquez-Barreiros, B., Mucientes, M., & Lama, M. (2016). Enhancing discovered processes with duplicate tasks. Information Sciences, 373, 369\u2013387. https:\/\/doi.org\/10.1016\/j.ins.2016.09.008","journal-title":"Information Sciences"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-025-00997-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10844-025-00997-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-025-00997-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:44:30Z","timestamp":1781613870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10844-025-00997-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,20]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["997"],"URL":"https:\/\/doi.org\/10.1007\/s10844-025-00997-7","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,20]]},"assertion":[{"value":"12 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not Applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}