{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:05:37Z","timestamp":1746158737935,"version":"3.40.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T00:00:00Z","timestamp":1745539200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2022R1F1A1072843"],"award-info":[{"award-number":["2022R1F1A1072843"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Process Sci"],"DOI":"10.1007\/s44311-025-00013-9","type":"journal-article","created":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T20:21:40Z","timestamp":1745612500000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Declarative process mining in big data scenarios using an application-agnostic framework"],"prefix":"10.1007","volume":"2","author":[{"given":"Ioannis","family":"Mavroudopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Balaktsis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Varvoutas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgia","family":"Kougka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Gounaris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Comuzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,25]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Alman A, Ciccio CD, Haas D, et\u00a0al (2020) Rule mining with rum. In: Proc. ICPM. IEEE, New York, pp 121\u2013128","DOI":"10.1109\/ICPM49681.2020.00027"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"102033","DOI":"10.1016\/j.is.2022.102033","volume":"109","author":"A Alman","year":"2022","unstructured":"Alman A, Maggi FM, Montali M et al (2022) Probabilistic declarative process mining. Inf Syst 109:102033","journal-title":"Inf Syst"},{"key":"13_CR3","unstructured":"Augusto, A., Awad, A., & Dumas, M. (2021). Efficient checking of temporal compliance rules over business process event logs. arXiv preprint arXiv:2112.04623."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10009-021-00616-0","volume":"24","author":"CO Back","year":"2022","unstructured":"Back CO, Slaats T, Hildebrandt TT et al (2022) Discover: accurate and efficient discovery of declarative process models. Int J Softw Tools Technol Transfer 24(4):563\u2013587","journal-title":"Int J Softw Tools Technol Transfer"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1109\/TSC.2015.2459703","volume":"8","author":"A Burattin","year":"2015","unstructured":"Burattin A, Cimitile M, Maggi FM et al (2015) Online discovery of declarative process models from event streams. IEEE Trans Serv Comput 8(6):833\u2013846","journal-title":"IEEE Trans Serv Comput"},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Ciccio CD, Mecella M (2015) On the discovery of declarative control flows for artful processes. ACM Trans Manage Inf Syst 5(4). https:\/\/doi.org\/10.1145\/2629447","DOI":"10.1145\/2629447"},{"issue":"6","key":"13_CR7","first-page":"1130","volume":"32","author":"J De Smedt","year":"2019","unstructured":"De Smedt J, Deeva G, De Weerdt J (2019) Mining behavioral sequence constraints for classification. IEEE TKDE 32(6):1130\u20131142","journal-title":"IEEE TKDE"},{"issue":"4","key":"13_CR8","first-page":"24:1","volume":"5","author":"C Di\u00a0Ciccio","year":"2015","unstructured":"Di\u00a0Ciccio C, Mecella M (2015) On the discovery of declarative control flows for artful processes. ACM Trans Manag Inf Syst 5(4):24:1-24:37","journal-title":"ACM Trans Manag Inf Syst"},{"key":"13_CR9","unstructured":"Donadello I et\u00a0al (2022) Declare4Py: A python library for declarative process mining. In: Proceedings of the Best Dissertation Award, Doctoral Consortium, and Demonstration & Resources Track at BPM 2022.\u00a0Spinger: Cham. pp 117\u2013121"},{"key":"13_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56509-4","volume-title":"Fundamentals of Business Process Management","author":"M Dumas","year":"2018","unstructured":"Dumas M, Rosa ML, Mendling J et al (2018) Fundamentals of Business Process Management, 2nd edn. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-662-56509-4","edition":"2"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10270-014-0395-3","volume":"15","author":"A Elgammal","year":"2016","unstructured":"Elgammal A, Turetken O, van den Heuvel WJ et al (2016) Formalizing and appling compliance patterns for business process compliance. Softw Syst Model 15:119\u2013146","journal-title":"Softw Syst Model"},{"issue":"1\u20132","key":"13_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s13740-021-00122-1","volume":"10","author":"S Esser","year":"2021","unstructured":"Esser S, Fahland D (2021) Multi-dimensional event data in graph databases. J Data Semant 10(1\u20132):109\u2013141","journal-title":"J Data Semant"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Leno V, Dumas M, Maggi FM (2018) Correlating activation and target conditions in data-aware declarative process discovery. In: Business Process Management: 16th International Conference, BPM 2018, Sydney, NSW, Australia, September 9\u201314, 2018, Proceedings 16.\u00a0Spinger: Cham. pp 176\u2013193","DOI":"10.1007\/978-3-319-98648-7_11"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Maggi FM, Bose RJC, van der Aalst WM (2012) Efficient discovery of understandable declarative process models from event logs. In: CAiSE.\u00a0Spinger: Cham. pp 270\u2013285","DOI":"10.1007\/978-3-642-31095-9_18"},{"issue":"P2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.is.2017.12.002","volume":"74","author":"FM Maggi","year":"2018","unstructured":"Maggi FM, Di Ciccio C, Di Francescomarino C et al (2018) Parallel algorithms for the automated discovery of declarative process models. Inf Syst 74(P2):136\u2013152","journal-title":"Inf Syst"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Maggi FM, Dumas M, Garc\u00eda-Ba\u00f1uelos L et\u00a0al (2013) Discovering data-aware declarative process models from event logs. In: Business Process Management: 11th International Conference, BPM 2013, Beijing, China, August 26-30, 2013. Proceedings.\u00a0Spinger: Cham. pp 81\u201396","DOI":"10.1007\/978-3-642-40176-3_8"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Maggi FM, Mooij AJ, van der Aalst WM (2011) User-guided discovery of declarative process models. In: IEEE CIDM. IEEE,\u00a0Spinger: Cham. pp 192\u2013199","DOI":"10.1109\/CIDM.2011.5949297"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Mavroudopoulos, I., & Gounaris, A. (2022). SIESTA: A scalable infrastructure of sequential pattern analysis. IEEE Transactions on Big Data, 9(3), 975-990.","DOI":"10.1109\/TBDATA.2022.3229092"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Mavroudopoulos I, Gounaris A (2024) A comprehensive scalable framework for cloud-native pattern detection with enhanced expressiveness.\u00a0CoRR\u00a0abs\/2401.09960. https:\/\/doi.org\/10.48550\/ARXIV.2401.09960","DOI":"10.48550\/ARXIV.2401.09960"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Mavroudopoulos I, Varvoutas K, Kougka G et\u00a0al (2024) Exploiting general purpose big-data frameworks in process mining: The case of declarative process discovery. In: International Conference on Business Process Management.\u00a0Spinger: Cham. pp 185\u2013202","DOI":"10.1007\/978-3-031-70396-6_11"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Navarin N, Cambiaso M, Burattin A et\u00a0al (2020) Towards online discovery of data-aware declarative process models from event streams. In: 2020 International Joint Conference on Neural Networks (IJCNN). IEEE,\u00a0Spinger: Cham. pp 1\u20138","DOI":"10.1109\/IJCNN48605.2020.9207500"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Pesic M, Schonenberg H, van der Aalst WM (2007) Declare: Full support for loosely-structured processes. In: Proc. EDOC.\u00a0Spinger: Cham. p 287","DOI":"10.1109\/EDOC.2007.14"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Sch\u00f6nig S, Solti A, Cabanillas C et\u00a0al (2016) Efficient and customisable declarative process mining with SQL. In: Proc. CAiSE.\u00a0Spinger: Cham. pp 290\u2013305","DOI":"10.1007\/978-3-319-39696-5_18"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.is.2018.09.005","volume":"80","author":"N van Beest","year":"2019","unstructured":"van Beest N, Groefsema H, Garc\u00eda-Ba\u00f1uelos L et al (2019) Variability in business processes: Automatically obtaining a generic specification. Inf Syst 80:36\u201355","journal-title":"Inf Syst"},{"key":"13_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-08848-3","volume-title":"Process Mining Handbook","author":"W van der Aalst","year":"2022","unstructured":"van der Aalst W, Carmona J (2022) Process Mining Handbook. Springer, Cham"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"van Dongen BF, de\u00a0Medeiros AKA, Verbeek HMW et\u00a0al (2005) The prom framework: A new era in process mining tool support. In: Ciardo G, Darondeau P (eds) Applications and Theory of Petri Nets 2005.\u00a0Spinger: Cham. pp 444\u2013454","DOI":"10.1007\/11494744_25"},{"key":"13_CR27","unstructured":"Westergaard M, Stahl C (2013) Leveraging super-scalarity and parallelism to provide fast declare mining without restrictions. In: BPM Demos.\u00a0Spinger: Cham. pp 31\u201335"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Zaki NM, Helal IM, Hassanein EE et\u00a0al (2022) Efficient checking of timed ordered anti-patterns over graph-encoded event logs. In: International Conference on Model and Data Engineering.\u00a0Spinger: Cham. pp 147\u2013161","DOI":"10.1007\/978-3-031-21595-7_11"},{"key":"13_CR29","doi-asserted-by":"publisher","unstructured":"Ziehn A, Grulich PM, Zeuch S, Markl V (2024) Bridging the gap: Complex event processing on stream processing systems. In: Tanca L, Luo Q, Polese G et\u00a0al (eds) Proceedings 27th International Conference on Extending Database Technology, EDBT 2024, Paestum, Italy, March 25 - March 28. OpenProceedings.org, pp 447\u2013460. https:\/\/doi.org\/10.48786\/EDBT.2024.39","DOI":"10.48786\/EDBT.2024.39"}],"container-title":["Process Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-025-00013-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44311-025-00013-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44311-025-00013-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:38:43Z","timestamp":1746088723000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44311-025-00013-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,25]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["13"],"URL":"https:\/\/doi.org\/10.1007\/s44311-025-00013-9","relation":{},"ISSN":["2948-2178"],"issn-type":[{"type":"electronic","value":"2948-2178"}],"subject":[],"published":{"date-parts":[[2025,4,25]]},"assertion":[{"value":"28 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2025","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The formulas in the second column of Table 2 were overflowing into the next column. The article has been updated to rectify the errors.","order":6,"name":"change_details","label":"Change Details","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":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6"}}