{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T14:18:58Z","timestamp":1785507538698,"version":"3.56.0"},"reference-count":26,"publisher":"Riga Technical University","issue":"47","license":[{"start":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T00:00:00Z","timestamp":1785456000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Complex Syst. Inform. Model. Q."],"abstract":"<jats:p>Object-Centric Process Mining (OCPM) often discovers models that are too dense and complex for effective human comprehension. To address this challenge, this work proposes a novel framework for the automated decomposition and aggregation of Object-Centric Petri Nets (OCPNs). The framework is based on the principles of high cohesion and low coupling. First, the Composite Cohesion Metric is introduced to measure the relational strength between object types from three distinct perspectives: behavioral synchronization, structural composition, and empirical log-based co-occurrence. By mapping these measures to a weighted graph and applying modularity-based community detection, the overall model is partitioned into semantically coherent sub-process modules. Finally, an Aggregated Net is constructed to offer a high-level architectural view of the system. The proposed framework is evaluated using the standard Order Management benchmark. The results demonstrate that the approach used successfully structures the process into distinct logical execution layers. The approach correctly assigns resource objects to their functional modules. The proposed framework significantly reduces the complexity of the model without affecting its global validity.<\/jats:p>","DOI":"10.7250\/csimq.2026-47.04","type":"journal-article","created":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T13:50:39Z","timestamp":1785505839000},"page":"84-104","source":"Crossref","is-referenced-by-count":0,"title":["Managing Complexity in Object-Centric Process Mining: A Cohesion-Driven Decomposition and Aggregation Framework"],"prefix":"10.7250","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9906-6074","authenticated-orcid":false,"given":"Khalil","family":"Mecheraoui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"4297","published-online":{"date-parts":[[2026,7,31]]},"reference":[{"key":"4115","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, Process Mining: Data Science in Action. 2nd edition, Springer, 2016.","DOI":"10.1007\/978-3-662-49851-4"},{"key":"4116","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, Process Mining Handbook. Lecture Notes in Business Information Processing, vol. 448. Springer, 2022.","DOI":"10.1007\/978-3-031-08848-3"},{"key":"4117","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, \u201cObject-centric process mining: Dealing with divergence and convergence in event data,\u201d in Software Engineering and Formal Methods. SEFM 2019. Lecture Notes in Computer Science, vol. 11724, Springer, 2019, pp. 3\u201325.","DOI":"10.1007\/978-3-030-30446-1_1"},{"key":"4118","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, \u201cObject-centric process mining: Unraveling the fabric of real processes,\u201d Mathematics, vol. 11, no. 12, article 2691, 2023.","DOI":"10.3390\/math11122691"},{"key":"4119","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst and A. Berti, \u201cDiscovering object-centric petri nets,\u201d Fundamenta Informaticae, vol. 175, no. 1\u20134, pp. 1\u201340, 2020.","DOI":"10.3233\/FI-2020-1946"},{"key":"4120","unstructured":"A. Berti, G. Park, M. Rafiei, and W. M. P. van der Aalst, \u201cOCEL 2.0 specification,\u201d RWTH Aachen University, Tech. Rep., 2024. Available: https:\/\/www.ocel-standard.org\/"},{"key":"4121","doi-asserted-by":"crossref","unstructured":"H. Dhama, \u201cQuantitative models of cohesion and coupling in software,\u201d Journal of Systems and Software, vol. 29, no. 1, pp. 65\u201374, 1995.","DOI":"10.1016\/0164-1212(94)00128-A"},{"key":"4122","doi-asserted-by":"crossref","unstructured":"D. L. Parnas, \u201cOn the criteria to be used in decomposing systems into modules,\u201d Communications of the ACM, vol. 15, no. 12, pp. 1053\u20131058, 1972.","DOI":"10.1145\/361598.361623"},{"key":"4123","doi-asserted-by":"crossref","unstructured":"V. D. Blondel, J.-L. Guillaume, R. Lambiotte, and E. Lefebvre, \u201cFast unfolding of communities in large networks,\u201d Journal of Statistical Mechanics: Theory and Experiment, vol. 2008, no. 10, article P10008, 2008.","DOI":"10.1088\/1742-5468\/2008\/10\/P10008"},{"key":"4124","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, \u201cDecomposing Petri nets for process mining: A generic approach,\u201d Distributed and Parallel Databases, vol. 31, pp. 471\u2013507, 2013.","DOI":"10.1007\/s10619-013-7127-5"},{"key":"4125","doi-asserted-by":"crossref","unstructured":"W. M. P. van der Aalst, \u201cDecomposing process mining problems using passages,\u201d in Application and Theory of Petri Nets. PETRI NETS 2012. Lecture Notes in Computer Science, vol. 7347, Springer, 2012, pp. 72\u201391.","DOI":"10.1007\/978-3-642-31131-4_5"},{"key":"4126","doi-asserted-by":"crossref","unstructured":"J. Mu\u00f1oz-Gama, J. Carmona, and W. M. P. van der Aalst, \u201cConformance checking in the large: Partitioning and topology,\u201d in Business Process Management. Lecture Notes in Computer Science, vol. 8094, Springer, 2013, pp. 130\u2013145.","DOI":"10.1007\/978-3-642-40176-3_11"},{"key":"4127","doi-asserted-by":"crossref","unstructured":"H. M. W. Verbeek and W. M. P. van der Aalst, \u201cMerging Alignments for Decomposed Replay,\u201d in Application and Theory of Petri Nets and Concurrency. PETRI NETS 2016. Lecture Notes in Computer Science, vol. 9698, Springer, 2016, pp. 219\u2013239.","DOI":"10.1007\/978-3-319-39086-4_14"},{"key":"4128","doi-asserted-by":"crossref","unstructured":"W. L. J. Lee, H. M. W. Verbeek, J. Mu\u00f1oz-Gama, W. M. P. van der Aalst, and M. Sep\u00falveda, \u201cRecomposing conformance: Closing the circle on decomposed alignment-based conformance checking in process mining,\u201d Information Sciences, vol. 466, pp. 55\u201391, 2018.","DOI":"10.1016\/j.ins.2018.07.026"},{"key":"4129","doi-asserted-by":"crossref","unstructured":"K. Mecheraoui, J. C. Carrasquel, and I. A. Lomazova, \u201cCompositional conformance checking of nested petri nets and event logs of multi-agent systems,\u201d arXiv preprint arXiv:2003.07291, 2020.","DOI":"10.1007\/978-3-030-72610-2_33"},{"key":"4130","doi-asserted-by":"crossref","unstructured":"M. Song, C. W. G\u00fcnther, and W. M. P. van der Aalst, \u201cTrace clustering in process mining,\u201d in Business Process Management Workshops. BPM 2008. Lecture Notes in Business Information Processing, vol. 17, Springer, 2009, pp. 109\u2013120.","DOI":"10.1007\/978-3-642-00328-8_11"},{"key":"4131","doi-asserted-by":"crossref","unstructured":"S. J. J. Leemans, D. Fahland, and W. M. P. van der Aalst, \u201cUsing life cycle information in process discovery,\u201d in Business Process Management Workshops. BPM 2015, Lecture Notes in Business Information Processing, vol. 256, Springer, 2016, pp. 204\u2013217.","DOI":"10.1007\/978-3-319-42887-1_17"},{"key":"4132","doi-asserted-by":"crossref","unstructured":"A. Jalali, \u201cObject Type Clustering Using Markov Directly-Follow Multigraph in Object-Centric Process Mining,\u201d IEEE Access, vol. 10, pp. 126569\u2013126579, 2022.","DOI":"10.1109\/ACCESS.2022.3226573"},{"key":"4133","unstructured":"S. Khayatbashi, N. Miri, and A. Jalali, \u201cAdvancing object-centric process mining with multi-dimensional data operations,\u201d arXiv preprint arXiv:2412.00393, 2024."},{"key":"4134","doi-asserted-by":"crossref","unstructured":"S. Khayatbashi, N. Miri, and A. Jalali, \u201cOLAP operations for object-centric process mining,\u201d in Intelligent Information Systems. CAiSE 2025. Lecture Notes in Business Information Processing, vol. 557, Springer, 2025, pp. 111\u2013118.","DOI":"10.1007\/978-3-031-94590-8_14"},{"key":"4135","doi-asserted-by":"crossref","unstructured":"A. Lomazova, \u201cNested Petri Nets \u2013 a Formalism for Specification and Verification of Multi-Agent Distributed Systems,\u201d Fundamenta Informaticae, vol. 43, no. 1\u20134, pp. 195\u2013214, 2000.","DOI":"10.3233\/FI-2000-43123410"},{"key":"4136","doi-asserted-by":"crossref","unstructured":"D. Fahland, \u201cDescribing behavior of processes with many-to-many interactions,\u201d in Application and Theory of Petri Nets and Concurrency. PETRI NETS 2019. Lecture Notes in Computer Science, vol. 11522, Springer, 2019, pp. 3\u201324.","DOI":"10.1007\/978-3-030-21571-2_1"},{"key":"4137","doi-asserted-by":"crossref","unstructured":"M. E. J. Newman and M. Girvan, \u201cFinding and evaluating community structure in networks,\u201d Physical Review E, vol. 69, no. 2, 2004.","DOI":"10.1103\/PhysRevE.69.026113"},{"key":"4138","doi-asserted-by":"crossref","unstructured":"M. E. J. Newman, \u201cModularity and community structure in networks,\u201d Proceedings of the National Academy of Sciences, vol. 103, no. 23, pp. 8577\u20138582, 2006.","DOI":"10.1073\/pnas.0601602103"},{"key":"4139","unstructured":"OCEL Standard, \u201cOrder Management \u2013 OCEL 2.0 simulation log,\u201d OCEL Standard Repository, 2023. Available: https:\/\/www.ocel-standard.org\/event-logs\/simulations\/order-management\/"},{"key":"4140","doi-asserted-by":"crossref","unstructured":"A. Berti, S. van Zelst, and D. Schuster, \u201cPM4Py: A process mining library for Python,\u201d Software Impacts, vol. 17, article 100556, 2023.","DOI":"10.1016\/j.simpa.2023.100556"}],"container-title":["Complex Systems Informatics and Modeling Quarterly"],"original-title":[],"link":[{"URL":"https:\/\/csimq-journals.rtu.lv\/csimq\/article\/download\/csimq.2026-47.04\/306","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/csimq-journals.rtu.lv\/csimq\/article\/download\/csimq.2026-47.04\/306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T13:50:45Z","timestamp":1785505845000},"score":1,"resource":{"primary":{"URL":"https:\/\/csimq-journals.rtu.lv\/csimq\/article\/view\/csimq.2026-47.04"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,31]]},"references-count":26,"journal-issue":{"issue":"47","published-online":{"date-parts":[[2026,7,31]]}},"URL":"https:\/\/doi.org\/10.7250\/csimq.2026-47.04","relation":{},"ISSN":["2255-9922"],"issn-type":[{"value":"2255-9922","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,31]]}}}