Probabilistic Model Checking of BPMN Processes at Runtime - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2022

Probabilistic Model Checking of BPMN Processes at Runtime

Résumé

Business Process Model and Notation (BPMN) is a standard business process modelling language that allows users to describe a set of structured tasks, which results in a service or product. Before running a BPMN process, the user often has no clear idea of the probability of executing some task or specific combination of tasks. This is, however, of prime importance for adjusting resources associated with tasks and thus optimising costs. In this paper, we define an approach to perform probabilistic model checking of BPMN models at runtime. To do so, we first transform the BPMN model into a Labelled Transition System (LTS). Then, by analysing the execution traces obtained when running multiple instances of the process, we can compute the probability of executing each transition in the LTS model, and thus generate a Probabilistic Transition System (PTS). Finally, we perform probabilistic model checking for verifying that the PTS model satisfies a given probabilistic property. This verification loop is applied periodically to update the results according to the execution of the process instances. All these steps are implemented in a tool chain, which was applied successfully to several realistic BPMN processes.
Fichier principal
Vignette du fichier
Probabilistic Model Checking of BPMN Processes at Runtime.pdf (3 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03665305 , version 1 (11-05-2022)

Identifiants

Citer

Yliès Falcone, Gwen Salaün, Ahang Zuo. Probabilistic Model Checking of BPMN Processes at Runtime. iFM 2022 - International Conference on integrated Formal Methods, Jun 2022, Lugano, Switzerland. pp.1-17, ⟨10.1007/978-3-031-07727-2_11⟩. ⟨hal-03665305⟩
255 Consultations
319 Téléchargements

Altmetric

Partager

More