Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model’s parameter space is searched for, driven by the resemblance between the log’s and the model’s stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model’s stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the “optimal” instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model’s instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.

Statistical Bayesian Inference for Stochastic Process Discovery

Ballarini, Paolo
;
Horváth, András;
2025-01-01

Abstract

Stochastic process discovery is concerned with deriving a model capable of reproducing the stochastic character of observed executions of a given process, stored in a log. This leads to an optimisation problem in which the model’s parameter space is searched for, driven by the resemblance between the log’s and the model’s stochastic languages. The bottleneck of such optimisation problem lay in the determination of the model’s stochastic language which existing approaches deal with through, hardly scalable, exact computation approaches. In this paper we introduce a novel framework in which we combine a simulation-based Bayesian parameter inference scheme, used to search for the “optimal” instance of a stochastic model, with an expressive statistical model checking engine, used (during inference) to approximate the language of the considered model’s instance. Because of its simulation-based nature, the payoff is that, the runtime for discovering of the optimal instance of a model can be easily traded in for accuracy, hence allowing to treat large models which would result in a prohibitive runtime with non-simulation based alternatives. We validate our approach on several popular event logs concerning real-life systems.
2025
2nd International Joint Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems, QEST+FORMATS 2025
Aarhus, Denmark
August 25-30, 2025.
Lecture Notes in Computer Science
Springer Science and Business Media Deutschland GmbH
16143
409
428
9783032057914
9783032057921
Earth Movers Distance; Hybrid automata; Statistical model checking; Stochastic languages; Stochastic process mining
Cry, Pierre; Ballarini, Paolo; Horváth, András; Gall, Pascale Le
File in questo prodotto:
File Dimensione Formato  
main.pdf

Accesso aperto

Dimensione 677.92 kB
Formato Adobe PDF
677.92 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/2114954
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact