Skip to Main content Skip to Navigation
Conference papers

Semi-automated Modelling of Optimized BPMN Processes

Yliès Falcone 1 Gwen Salaün 2 Ahang Zuo 2 
1 CORSE - Compiler Optimization and Run-time Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
2 CONVECS - Construction of verified concurrent systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : In this paper, we propose a semi-automated approach for helping non-experts in BPMN to model business processes using this notation. We focus on a timed version of BPMN where tasks are associated with a range indicating the minimum and maximum duration needed to execute that task. In a first step, the user defines the tasks involved in the process and possibly gives a partial order between tasks. A first algorithm then generates an abstract graph, which serves as a simplified version of the process being specified. Given such an abstract graph, a second algorithm computes the minimum and maximum time for executing the whole graph. The user can rely on this information for refining the graph. For each version of the graph, these minimum/maximum execution times are computed. Once the user is satisfied with a specific abstract graph, we propose a third algorithm to synthesize the BPMN process from that graph.
Document type :
Conference papers
Complete list of metadata
Contributor : Ahang Zuo Connect in order to contact the contributor
Submitted on : Tuesday, August 31, 2021 - 4:53:58 PM
Last modification on : Wednesday, July 6, 2022 - 4:19:39 AM
Long-term archiving on: : Wednesday, December 1, 2021 - 9:47:44 PM


Semi-automated Modelling of Op...
Files produced by the author(s)


  • HAL Id : hal-03330330, version 1


Yliès Falcone, Gwen Salaün, Ahang Zuo. Semi-automated Modelling of Optimized BPMN Processes. SCC 2021 - IEEE International Conference on Services Computing, Sep 2021, CHICAGO / Virtual, United States. pp.1-6. ⟨hal-03330330⟩



Record views


Files downloads