Computing the Parallelism Degree of Timed BPMN Processes

Abstract : A business process is a combination of structured and related activities that aim at fulfilling a specific organizational goal for a customer or market. An important measure when developing a business process is the degree of parallelism, namely, the maximum number of tasks that are executable in parallel at any given time in a process. This measure determines the peak demand on tasks and thus can provide valuable insight on the problem of resource allocation in business processes. This paper considers timed business processes modeled in BPMN, a workflow-based graphical notation for processes, where execution times can be associated to several BPMN constructs such as tasks and flows. An encoding of timed business processes into Maude's rewriting logic system is presented, enabling the automatic computation of timed degrees of parallelism for business processes. The approach is illustrated with a simple yet realistic case study in which the degree of parallelism is used to improve the business process design with the ultimate goal of optimizing resources and, therefore, with the potential for reducing operating costs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-01961952
Contributor : Gwen Salaün <>
Submitted on : Monday, January 14, 2019 - 12:54:41 PM
Last modification on : Thursday, February 7, 2019 - 3:36:18 PM
Long-term archiving on : Monday, April 15, 2019 - 12:11:08 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Francisco Durán, Camilo Rocha, Gwen Salaün. Computing the Parallelism Degree of Timed BPMN Processes. FOCLASA 2018 - 16th International Workshop on Foundations of Coordination Languages and Self-Adaptative Systems, Jun 2018, Toulouse, France. pp.1-16, ⟨10.1007/978-3-030-04771-9_24⟩. ⟨hal-01961952⟩

Share

Metrics

Record views

79

Files downloads

195