Paper Info
Title
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.
Year
DOI
Venue
2014
10.1145/2602458.2602473
CBSE
Keywords
Field
DocType
degree of parallelism,model checking,bpmn process,labelled transition system,process algebra
Implicit parallelism,Model checking,Programming language,Business process,Task parallelism,Computer science,Degree of parallelism,Process calculus,Business Process Model and Notation,Executable
Conference
Citations 
PageRank 
References 
4
0.38
19
Authors
3
Name
Order
Citations
PageRank
Radu Mateescu141.74
Gwen Salaün298871.03
Lina Ye3268.75