Enjoy the silence: Analysis of stochastic Petri nets with silent transitions

被引:6
作者
Leemans, Sander J. J. [1 ,2 ]
Maggi, Fabrizio Maria [3 ]
Montali, Marco [3 ]
机构
[1] Rhein Westfal TH Aachen, Aachen, Germany
[2] Fraunhofer, Bremen, Germany
[3] Free Univ Bozen Bolzano, Bolzano, Italy
关键词
Stochastic Petri nets; Stochastic process mining; Silent transitions; Qualitative verification; Markov chains;
D O I
10.1016/j.is.2024.102383
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Capturing stochastic behaviour in business and work processes is essential to quantitatively understand how nondeterminism is resolved when taking decisions within the process. This is of special interest in process mining, where event data tracking the actual execution of the process are related to process models, and can then provide insights on frequencies and probabilities. Variants of stochastic Petri nets provide a natural formal basis to represent stochastic behaviour and support different data -driven and model-driven analysis tasks in this spectrum. However, when capturing business processes, such nets inherently need a labelling that maps between transitions and activities. In many state of the art process mining techniques, this labelling is not 1 -on -1, leading to unlabelled transitions and activities represented by multiple transitions. At the same time, they have to be analysed in a finite-trace semantics, matching the fact that each process execution consists of finitely many steps. These two aspects impede the direct application of existing techniques for stochastic Petri nets, calling for a novel characterisation that incorporates labels and silent transitions in a finite-trace semantics. In this article, we provide such a characterisation starting from generalised stochastic Petri nets and obtaining the framework of labelled stochastic processes (LSPs). On top of this framework, we introduce different key analysis tasks on the traces of LSPs and their probabilities. We show that all such analysis tasks can be solved analytically, in particular reducing them to a single method that combines automata-based techniques to single out the behaviour of interest within an LSP, with techniques based on absorbing Markov chains to reason on their probabilities. Finally, we demonstrate the significance of how our approach in the context of stochastic conformance checking, illustrating practical feasibility through a proof -of -concept implementation and its application to different datasets.
引用
收藏
页数:22
相关论文
共 57 条
[1]   Entropic relevance: A mechanism for measuring stochastic process models discovered from event data [J].
Alkhammash, Hanan ;
Polyvyanyy, Artem ;
Moffat, Alistair ;
Garcia-Banuelos, Luciano .
INFORMATION SYSTEMS, 2022, 107
[2]   Probabilistic declarative process mining [J].
Alman, Anti ;
Maggi, Fabrizio Maria ;
Montali, Marco ;
Penaloza, Rafael .
INFORMATION SYSTEMS, 2022, 109
[3]  
[Anonymous], 1995, WILEY SERIES PARALLE
[4]   Split miner: automated discovery of accurate and simple business process models from event logs [J].
Augusto, Adriano ;
Conforti, Raffaele ;
Dumas, Marlon ;
La Rosa, Marcello ;
Polyvyanyy, Artem .
KNOWLEDGE AND INFORMATION SYSTEMS, 2019, 59 (02) :251-284
[5]  
Baier C, 2008, PRINCIPLES OF MODEL CHECKING, P1
[6]   Probabilistic Trace Alignment [J].
Bergami, Giacomo ;
Maggi, Fabrizio Maria ;
Montali, Marco ;
Penaloza, Rafael .
2021 3RD INTERNATIONAL CONFERENCE ON PROCESS MINING (ICPM 2021), 2021, :9-16
[7]   Probabilistic Trace Alignment [J].
Bergami, Giacomo ;
Maggi, Fabrizio Maria ;
Montali, Marco ;
Penaloza, Rafael .
2021 3RD INTERNATIONAL CONFERENCE ON PROCESS MINING (ICPM 2021), 2021, :9-16
[8]  
Berkelaar M., 2004, lpsolve 5.5, open source (mixed-integer) linear programming system
[9]   CONCURRENCY AND PROBABILITY: REMOVING CONFUSION, COMPOSITIONALLY [J].
Bruni, Roberto ;
Melgratti, Hernan ;
Montanari, Ugo .
LOGICAL METHODS IN COMPUTER SCIENCE, 2019, 15 (04) :17:1-17:39
[10]  
Buijs JCAM, 2012, IEEE C EVOL COMPUTAT