Run-time planning of case-based business processes - Université Paris 1 Panthéon-Sorbonne Access content directly
Conference Papers Year : 2016

Run-time planning of case-based business processes

Daniel Diaz
Raul Mazo
Knut Hinkelmann
  • Function : Author
  • PersonId : 997053


Context: Organizations act in highly competitive markets, which forces them to be flexible. Constantly changing business requirements require flexible business processes. Case Management Model and Notation (CMMN) supports modeling run-time flexibility of partially structured business process models, but does not fully specify the control flow. Objective: The goal is to develop a planning algorithm that supports the case worker in planning case-based business processes at run-time. Method: We identify the requirements of run-time planning of partly structured processes by analyzing the admission process for the master degree at FHNW. To plan the process instance, we develop a planning algorithm. Our planning algorithm is evaluated using concrete cases provided by FHNW in order to demonstrate real application. Results: The planning algorithm reflects the requirements for serializing tasks at run-time. Conclusion: Our planning algorithm allows to automatically deriving context-specific execution plans for CMMN models at run-time.
Fichier principal
Vignette du fichier
RCIS2016_Run-Time Planning of Case-based Business Processes.pdf (456.39 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01423708 , version 1 (31-12-2016)



Danillo Sprovieri, Daniel Diaz, Raul Mazo, Knut Hinkelmann. Run-time planning of case-based business processes. IEEE 10th International Conference on Research Challenges in Information Science, Jun 2016, Grenoble, France. pp.1 - 6, ⟨10.1109/RCIS.2016.7549282⟩. ⟨hal-01423708⟩


228 View
475 Download



Gmail Facebook Twitter LinkedIn More