Verifying Timed BPMN Processes Using Maude - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Verifying Timed BPMN Processes Using Maude

Abstract

A business process is a collection of structured activities producing a particular product or software. BPMN is a workflow-based graphical notation for specifying business processes. Formally analyzing such processes is a crucial challenge in order to avoid erroneous executions of the corresponding software. In this paper, we focus on timed business processes where execution time can be associated to several BPMN constructs. We propose an encoding of timed business processes into the Maude language, which allows one to automatically verify several properties of interest on processes such as the maximum/minimum/av-erage execution time or the timed degree of parallelism that provides a valuable guide for the problem of resource allocation. The analysis is achieved using the rewriting-based tools available in Maude, which also provides other techniques (e.g., reachability analysis and model checking) for verifying BPMN specifications. We applied our approach on a large set of BPMN processes for evaluation purposes.
Fichier principal
Vignette du fichier
main.pdf (499.95 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01538104 , version 1 (13-06-2017)

Identifiers

Cite

Francisco Durán, Gwen Salaün. Verifying Timed BPMN Processes Using Maude. 19th International Conference on Coordination Languages and Models (COORDINATION), Jun 2017, Neuchâtel, Switzerland. pp.219-236, ⟨10.1007/978-3-319-59746-1_12⟩. ⟨hal-01538104⟩
209 View
486 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More