Quantifying the Parallelism in BPMN Processes using Model Checking - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Quantifying the Parallelism in BPMN Processes using Model Checking

Abstract

A business process is a set of structured, related activities that aims at fulfilling a specific organizational goal for a customer or market. An important metric when developing a business process is its degree of parallelism, i.e., the maximum number of tasks that are executable in parallel in that process. The degree of parallelism determines the peak demand on tasks, providing a valuable guide for the problem of resource allocation in business processes. In this paper, we investigate how to automatically measure the degree of parallelism for business processes, described using the BPMN standard notation. We first present a formal model for BPMN processes in terms of Labelled Transition Systems, which are obtained through process algebra encodings. We then propose an approach for automatically computing the degree of parallelism by using model checking techniques and dichotomic search. We implemented a tool for automating this check and we applied it successfully to more than one hundred BPMN processes.
Fichier principal
Vignette du fichier
main.pdf (1.02 Mo) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01016412 , version 1 (30-06-2014)

Identifiers

  • HAL Id : hal-01016412 , version 1

Cite

Radu Mateescu, Gwen Salaün, Lina Ye. Quantifying the Parallelism in BPMN Processes using Model Checking. The 17th International ACM Sigsoft Symposium on Component-Based Software Engineering (CBSE 2014), Jun 2014, Lille, France. ⟨hal-01016412⟩
536 View
411 Download

Share

Gmail Mastodon Facebook X LinkedIn More