Performance Analysis: Discovering Semi-Markov Models From Event Logs

被引:0
作者
Kalenkova, Anna [1 ]
Mitchell, Lewis [1 ]
Roughan, Matthew [1 ]
机构
[1] Univ Adelaide, Adelaide Data Sci Ctr ADSC, Sch Comp & Math Sci, North Terrace Campus, Adelaide, SA 5000, Australia
来源
IEEE ACCESS | 2025年 / 13卷
基金
澳大利亚研究理事会;
关键词
Analytical models; Hidden Markov models; Stochastic processes; Performance analysis; Context modeling; Data models; Process mining; Petri nets; Computational modeling; Predictive models; Event logs; Gaussian mixture models; performance analysis; process mining; semi-Markov processes; time distributions;
D O I
10.1109/ACCESS.2025.3546033
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Process mining is a well-established discipline of data analysis focused on the discovery of process models from information systems' event logs. Recently, an emerging subarea of process mining, known as stochastic process discovery, has started to evolve. Stochastic process discovery considers frequencies of events in the event data and allows for a more comprehensive analysis. In particular, when the durations of activities are presented in the event log, performance characteristics of the discovered stochastic models can be analyzed, e.g., the overall process execution time can be estimated. Existing performance analysis techniques usually discover stochastic process models from event data, and then simulate these models to evaluate their execution times. These methods rely on empirical approaches. This paper proposes analytical techniques for performance analysis that allow for the derivation of statistical characteristics of the overall processes' execution times in the presence of arbitrary time distributions of events modeled by semi-Markov processes. The proposed methods include express analysis, focused on the mean execution time estimation, and full analysis techniques that build probability density functions (PDFs) of process execution times in both continuous and discrete forms. These methods are implemented and tested on real-world event data, demonstrating their potential for what-if analysis by providing solutions without resorting to simulation. Specifically, we demonstrated that the discrete approach is more time-efficient for small duration support sizes compared to the simulation technique. Furthermore, we showed that the continuous approach, with PDFs represented as Mixtures of Gaussian Models (GMMs), facilitates the discovery of more compact and interpretable models.
引用
收藏
页码:38035 / 38053
页数:19
相关论文
共 59 条
[1]  
Adriansyah A, 2013, LECT NOTES BUS INF P, V132, P217
[2]   Data-Driven Identification and Analysis of Waiting Times in Business Processes [J].
Ali, Muhammad Awais ;
Milani, Fredrik ;
Dumas, Marlon .
BUSINESS & INFORMATION SYSTEMS ENGINEERING, 2025, 67 (02) :191-208
[3]   Stochastic Directly-Follows Process Discovery Using Grammatical Inference [J].
Alkhammash, Hanan ;
Polyvyanyy, Artem ;
Moffat, Alistair .
ADVANCED INFORMATION SYSTEMS ENGINEERING, CAISE 2024, 2024, 14663 :87-103
[4]  
Anastasiou N., 2011, P 5 INT ICST C PERF, P1
[5]  
Andersen PK, 2002, STAT METHODS MED RES, V11, P91, DOI 10.1191/0962280202SM276ra
[6]  
[Anonymous], 2005, Standard ISO9000:2015
[7]   Abstract-and-Compare: A Family of Scalable Precision Measures for Automated Process Discovery [J].
Augusto, Adriano ;
Armas-Cervantes, Abel ;
Conforti, Raffaele ;
Dumas, Marlon ;
La Rosa, Marcello ;
Reissner, Daniel .
BUSINESS PROCESS MANAGEMENT (BPM 2018), 2018, 11080 :158-175
[8]   APPROXIMATION OF DENSITY-FUNCTIONS BY SEQUENCES OF EXPONENTIAL-FAMILIES [J].
BARRON, AR ;
SHEU, CH .
ANNALS OF STATISTICS, 1991, 19 (03) :1347-1369
[9]  
Berti A., 2019, P ICPM DEMO TRACK 20, P13
[10]   Conformance Checking over Stochastically Known Logs [J].
Bogdanov, Eli ;
Cohen, Izack ;
Gal, Avigdor .
BUSINESS PROCESS MANAGEMENT FORUM, 2022, 458 :105-119