Instantaneous, Comprehensible, and Fixable Soundness Checking of Realistic BPMN Models
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929412712169472 |
|---|---|
| author | Kräuter, Tim Stünkel, Patrick Rutle, Adrian König, Harald Lamo, Yngve |
| author_facet | Kräuter, Tim Stünkel, Patrick Rutle, Adrian König, Harald Lamo, Yngve |
| contents | Many business process models have control-flow errors, such as deadlocks, which can hinder proper execution. In this paper, we introduce our new soundness-checking tool that can instantaneously identify errors in BPMN models, make them comprehensible for modelers, and even suggest corrections to resolve them automatically. We demonstrate that our tool's soundness checking is instantaneous, i.e., it takes less than 500ms, by benchmarking our tool against synthetic BPMN models with increasing size and state space complexity, as well as realistic models provided in the literature. Moreover, the tool directly displays possible soundness violations in the model and provides an interactive counterexample visualization of each violation. Additionally, it provides fixes to resolve the violations found, which are not currently available in other tools. The tool is open-source, modular, extensible, and integrated into a popular BPMN modeling tool. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_03965 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Instantaneous, Comprehensible, and Fixable Soundness Checking of Realistic BPMN Models Kräuter, Tim Stünkel, Patrick Rutle, Adrian König, Harald Lamo, Yngve Software Engineering Many business process models have control-flow errors, such as deadlocks, which can hinder proper execution. In this paper, we introduce our new soundness-checking tool that can instantaneously identify errors in BPMN models, make them comprehensible for modelers, and even suggest corrections to resolve them automatically. We demonstrate that our tool's soundness checking is instantaneous, i.e., it takes less than 500ms, by benchmarking our tool against synthetic BPMN models with increasing size and state space complexity, as well as realistic models provided in the literature. Moreover, the tool directly displays possible soundness violations in the model and provides an interactive counterexample visualization of each violation. Additionally, it provides fixes to resolve the violations found, which are not currently available in other tools. The tool is open-source, modular, extensible, and integrated into a popular BPMN modeling tool. |
| title | Instantaneous, Comprehensible, and Fixable Soundness Checking of Realistic BPMN Models |
| topic | Software Engineering |
| url | https://arxiv.org/abs/2407.03965 |