Translating Workflow Nets into the Partially Ordered Workflow Language
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908546186084352 |
|---|---|
| author | Kourani, Humam Park, Gyunam van der Aalst, Wil |
| author_facet | Kourani, Humam Park, Gyunam van der Aalst, Wil |
| contents | The Partially Ordered Workflow Language (POWL) has recently emerged as a process modeling notation, offering strong quality guarantees and high expressiveness. However, its adoption is hindered by the prevalence of standard notations like workflow nets (WF-nets) and BPMN in practice. This paper presents a novel algorithm for transforming safe and sound WF-net into equivalent POWL models. The algorithm recursively identifies structural patterns within the WF-net and translates them into their POWL representation. We formally prove the correctness of our approach, showing that the generated POWL model preserves the language of the input WF-net. Furthermore, we demonstrate the high scalability of our algorithm, and we show its completeness on a subclass of WF-nets that encompasses equivalent representations for all POWL models. This work bridges the gap between the theoretical advantages of POWL and the practical need for compatibility with established notations, paving the way for broader adoption of POWL in process analysis and improvement applications. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20363 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Translating Workflow Nets into the Partially Ordered Workflow Language Kourani, Humam Park, Gyunam van der Aalst, Wil Logic in Computer Science The Partially Ordered Workflow Language (POWL) has recently emerged as a process modeling notation, offering strong quality guarantees and high expressiveness. However, its adoption is hindered by the prevalence of standard notations like workflow nets (WF-nets) and BPMN in practice. This paper presents a novel algorithm for transforming safe and sound WF-net into equivalent POWL models. The algorithm recursively identifies structural patterns within the WF-net and translates them into their POWL representation. We formally prove the correctness of our approach, showing that the generated POWL model preserves the language of the input WF-net. Furthermore, we demonstrate the high scalability of our algorithm, and we show its completeness on a subclass of WF-nets that encompasses equivalent representations for all POWL models. This work bridges the gap between the theoretical advantages of POWL and the practical need for compatibility with established notations, paving the way for broader adoption of POWL in process analysis and improvement applications. |
| title | Translating Workflow Nets into the Partially Ordered Workflow Language |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2503.20363 |