{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:38:22Z","timestamp":1783183102941,"version":"3.54.6"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T00:00:00Z","timestamp":1548028800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP150103356"],"award-info":[{"award-number":["DP150103356"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002301","name":"Estonian Research Council","doi-asserted-by":"crossref","award":["IUT20-55"],"award-info":[{"award-number":["IUT20-55"]}],"id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2019,2,28]]},"abstract":"<jats:p>Process mining techniques aim at analyzing records generated during the execution of a business process in order to provide insights on the actual performance of the process. Detecting concurrency relations between events is a fundamental primitive underpinning a range of process mining techniques. Existing approaches to this problem identify concurrency relations at the level of event types under a global interpretation. If two event types are declared to be concurrent, every occurrence of one event type is deemed to be concurrent to one occurrence of the other. In practice, this interpretation is too coarse-grained and leads to over-generalization. This article proposes a finer-grained approach, whereby two event types may be deemed to be in a concurrency relation relative to one state of the process, but not relative to other states. In other words, the detected concurrency relation holds locally, relative to a set of states. Experimental results both with artificial and real-life logs show that the proposed local concurrency detection approach improves the accuracy of existing concurrency detection techniques.<\/jats:p>","DOI":"10.1145\/3289181","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T13:17:41Z","timestamp":1548163061000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Local Concurrency Detection in Business Process Event Logs"],"prefix":"10.1145","volume":"19","author":[{"given":"Abel","family":"Armas-Cervantes","sequence":"first","affiliation":[{"name":"The University of Melbourne, Parkville, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marlon","family":"Dumas","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9568-4035","authenticated-orcid":false,"given":"Marcello La","family":"Rosa","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Parkville, Melbourne, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abderrahmane","family":"Maaradji","sequence":"additional","affiliation":[{"name":"University of Algiers 1, Algiers, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,1,21]]},"reference":[{"key":"e_1_2_1_2_1","volume-title":"van der Aalst","author":"Jagadeesh Chandra Bose R. P.","year":"2010","unstructured":"R. P. Jagadeesh Chandra Bose and Wil M. P . van der Aalst . 2010 . Trace Clustering Based on Conserved Patterns : Towards Achieving Better Process Models. Springer , Berlin, 170--181. R. P. Jagadeesh Chandra Bose and Wil M. P. van der Aalst. 2010. Trace Clustering Based on Conserved Patterns: Towards Achieving Better Process Models. Springer, Berlin, 170--181."},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the AAAI Spring Symposium on Artificial Intelligence for Business Agility. AAAI Press, 9--14","author":"Brander Simon","year":"2011","unstructured":"Simon Brander , Knut Hinkelmann , Andreas Martin , and Barbara Th\u00f3nssen . 2011 . Mining of agile business processes . In Proceedings of the AAAI Spring Symposium on Artificial Intelligence for Business Agility. AAAI Press, 9--14 . Simon Brander, Knut Hinkelmann, Andreas Martin, and Barbara Th\u00f3nssen. 2011. Mining of agile business processes. In Proceedings of the AAAI Spring Symposium on Artificial Intelligence for Business Agility. AAAI Press, 9--14."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2614680"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/288195.288214"},{"key":"e_1_2_1_6_1","volume-title":"Process Mining Based on Clustering: A Quest for Precision","author":"Alves de Medeiros Ana Karla","unstructured":"Ana Karla Alves de Medeiros , Antonella Guzzo , Gianluigi Greco , Wil M. P. van der Aalst , Ton Weijters , Boudewijn F. van Dongen , and Domenico Sacc\u00e1 . 2008. Process Mining Based on Clustering: A Quest for Precision . Springer , Berlin , 17--29. Ana Karla Alves de Medeiros, Antonella Guzzo, Gianluigi Greco, Wil M. P. van der Aalst, Ton Weijters, Boudewijn F. van Dongen, and Domenico Sacc\u00e1. 2008. Process Mining Based on Clustering: A Quest for Precision. Springer, Berlin, 17--29."},{"key":"e_1_2_1_7_1","volume-title":"Process Mining: Extending the &alpha;-algorithm to Mine Short Loops. Technical Report","author":"Alves de Medeiros Ana Karla","year":"2004","unstructured":"Ana Karla Alves de Medeiros , Boudewijn F. van Dongen , Wil M. P. van der Aalst , and Ton Weijters . 2004 . Process Mining: Extending the &alpha;-algorithm to Mine Short Loops. Technical Report . Eindhoven University of Technology , Eindhoven . Ana Karla Alves de Medeiros, Boudewijn F. van Dongen, Wil M. P. van der Aalst, and Ton Weijters. 2004. Process Mining: Extending the &alpha;-algorithm to Mine Short Loops. Technical Report. Eindhoven University of Technology, Eindhoven."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.04.021"},{"key":"e_1_2_1_9_1","volume-title":"Proc","author":"Dumas Marlon","unstructured":"Marlon Dumas and Luciano Garc\u00eda-Ba\u00f1uelos . 2015. Process mining reloaded: Event structures as a unified representation of process models and event logs . In Proc . of PETRI NETS. Springer , 33--48. Marlon Dumas and Luciano Garc\u00eda-Ba\u00f1uelos. 2015. Process mining reloaded: Event structures as a unified representation of process models and event logs. In Proc. of PETRI NETS. Springer, 33--48."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2012.07.004"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2017.2668418"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.123"},{"key":"e_1_2_1_13_1","volume-title":"Proeedings of the 5th IFIP WG 2.6 International Symposium on Data-Driven Process Discovery and Analysis (SIMPDA\u201915). 54--75.","author":"Hompes Bart F. A.","unstructured":"Bart F. A. Hompes , Joos C. A. M. Buijs , Wil M. P. van der Aalst , Prabhakar Dixit , and Johannes Buurman . 2015. Detecting change in processes using comparative trace clustering . In Proeedings of the 5th IFIP WG 2.6 International Symposium on Data-Driven Process Discovery and Analysis (SIMPDA\u201915). 54--75. Bart F. A. Hompes, Joos C. A. M. Buijs, Wil M. P. van der Aalst, Prabhakar Dixit, and Johannes Buurman. 2015. Detecting change in processes using comparative trace clustering. In Proeedings of the 5th IFIP WG 2.6 International Symposium on Data-Driven Process Discovery and Analysis (SIMPDA\u201915). 54--75."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2012.10.001"},{"key":"e_1_2_1_15_1","volume-title":"van der Aalst","author":"Leemans Sander J. J.","year":"2015","unstructured":"Sander J. J. Leemans , Dirk Fahland , and Wil M. P . van der Aalst . 2015 . Using life cycle information in process discovery. (in press) BPM Workshops . Sander J. J. Leemans, Dirk Fahland, and Wil M. P. van der Aalst. 2015. Using life cycle information in process discovery. (in press) BPM Workshops."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38697-8_17"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72909-9_43"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23063-4_27"},{"key":"e_1_2_1_19_1","volume-title":"Marcello La Rosa, and Alireza Ostovar","author":"Maaradji Abderrahmane","year":"2017","unstructured":"Abderrahmane Maaradji , Marlon Dumas , Marcello La Rosa, and Alireza Ostovar . 2017 . Detecting sudden and gradual drifts in business processes based on event logs. IEEE TKDE 29--10 (2017), 2140--2154. Abderrahmane Maaradji, Marlon Dumas, Marcello La Rosa, and Alireza Ostovar. 2017. Detecting sudden and gradual drifts in business processes based on event logs. IEEE TKDE 29--10 (2017), 2140--2154."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of ATAED.","author":"Mokhov Andrey","year":"2015","unstructured":"Andrey Mokhov and Josep Carmona . 2015 . Event log visualisation with conditional partial order graphs: From control flow to data . In Proceedings of ATAED. Andrey Mokhov and Josep Carmona. 2015. Event log visualisation with conditional partial order graphs: From control flow to data. In Proceedings of ATAED."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.58"},{"key":"e_1_2_1_22_1","volume-title":"Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 1","author":"Nielsen Mogens","year":"1981","unstructured":"Mogens Nielsen , Gordon Plotkin , and Glynn Winskel . 1981. Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 1 ( 1981 ). Mogens Nielsen, Gordon Plotkin, and Glynn Winskel. 1981. Petri nets, event structures and domains, part I. Theoretical Computer Science 13, 1 (1981)."},{"key":"e_1_2_1_23_1","first-page":"460","article-title":"Improving process mining with trace clustering","volume":"34","author":"Song Minseok","year":"2008","unstructured":"Minseok Song , Christian W. G\u00fcnther , and Wil M. P. van der Aalst . 2008 . Improving process mining with trace clustering . J. Korean Inst. Ind. Eng. 34 , 4 (2008), 460 -- 469 . Minseok Song, Christian W. G\u00fcnther, and Wil M. P. van der Aalst. 2008. Improving process mining with trace clustering. J. Korean Inst. Ind. Eng. 34, 4 (2008), 460--469.","journal-title":"J. Korean Inst. Ind. Eng."},{"key":"e_1_2_1_24_1","volume-title":"van der Aalst","author":"Song Minseok","year":"2009","unstructured":"Minseok Song , Christian W. G\u00fcnther , and Wil M. P . van der Aalst . 2009 . Trace Clustering in Process Mining. Springer , Berlin, 109--120. Minseok Song, Christian W. G\u00fcnther, and Wil M. P. van der Aalst. 2009. Trace Clustering in Process Mining. Springer, Berlin, 109--120."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23063-4_26"},{"key":"e_1_2_1_26_1","volume-title":"Process Cubes: Slicing, Dicing, Rolling Up and Drilling Down Event Data for Process Mining","author":"van der Aalst Wil M. P.","year":"2013","unstructured":"Wil M. P. van der Aalst . 2013 . Process Cubes: Slicing, Dicing, Rolling Up and Drilling Down Event Data for Process Mining . In Asia Pacific BPM. Springer International Publishing , 1--22. Wil M. P. van der Aalst. 2013. Process Cubes: Slicing, Dicing, Rolling Up and Drilling Down Event Data for Process Mining. In Asia Pacific BPM. Springer International Publishing, 1--22."},{"key":"e_1_2_1_27_1","volume-title":"Process mining: A two-step approach to balance between underfitting and overfitting. SoSyM 9--1","author":"van der Aalst Wil M. P.","year":"2008","unstructured":"Wil M. P. van der Aalst , Vladimir Rubin , Eric Verbeek , Boudewijn F. van Dongen , Ekkart Kindler , and Christian G\u00fcnther . 2008. Process mining: A two-step approach to balance between underfitting and overfitting. SoSyM 9--1 ( 2008 ), 87. Wil M. P. van der Aalst, Vladimir Rubin, Eric Verbeek, Boudewijn F. van Dongen, Ekkart Kindler, and Christian G\u00fcnther. 2008. Process mining: A two-step approach to balance between underfitting and overfitting. SoSyM 9--1 (2008), 87."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.47"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35179-2_14"},{"key":"e_1_2_1_30_1","volume-title":"van der Aalst","author":"van Dongen Boudewijn F.","year":"2004","unstructured":"Boudewijn F. van Dongen and Wil M. P . van der Aalst . 2004 . Multi-phase process mining: Building instance graphs. In Proceedings of ER. Springer Berlin Heidelberg , 362--376. Boudewijn F. van Dongen and Wil M. P. van der Aalst. 2004. Multi-phase process mining: Building instance graphs. In Proceedings of ER. Springer Berlin Heidelberg, 362--376."},{"key":"e_1_2_1_31_1","volume-title":"Jan Vanthienen, and Bart Baesens.","author":"Broucke Seppe Vanden","year":"2012","unstructured":"Seppe Vanden Broucke , Jochen De Weerdt , Jan Vanthienen, and Bart Baesens. 2012 . An Improved Process Event Log Artificial Negative Event Generator. Technical Report. FEB, KU Leuven, Belgium . Seppe Vanden Broucke, Jochen De Weerdt, Jan Vanthienen, and Bart Baesens. 2012. An Improved Process Event Log Artificial Negative Event Generator. Technical Report. FEB, KU Leuven, Belgium."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.64"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0065-y"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289181","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3289181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:23Z","timestamp":1750208543000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,21]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,2,28]]}},"alternative-id":["10.1145\/3289181"],"URL":"https:\/\/doi.org\/10.1145\/3289181","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,21]]},"assertion":[{"value":"2016-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-01-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}