Next Article in Journal
Identifying Influential Nodes of Complex Networks Based on Trust-Value
Next Article in Special Issue
Efficient Time and Space Representation of Uncertain Event Data
Previous Article in Journal
Using Zigzag Persistent Homology to Detect Hopf Bifurcations in Dynamical Systems
Previous Article in Special Issue
Investigating Social Contextual Factors in Remaining-Time Predictive Process Monitoring—A Survival Analysis Approach
Open AccessArticle

Translating Workflow Nets to Process Trees: An Algorithmic Approach

1
Institute for Applied Information Technology (FIT), Fraunhofer Gesellschaft, 53754 Sankt Augustin, Germany
2
Chair of Process and Data Science, RWTH Aachen University, 52074 Aachen, Germany
3
School of Information Systems, Queensland University of Technology, Brisbane City QLD 4000, Australia
*
Author to whom correspondence should be addressed.
Algorithms 2020, 13(11), 279; https://doi.org/10.3390/a13110279
Received: 29 September 2020 / Revised: 28 October 2020 / Accepted: 29 October 2020 / Published: 2 November 2020
(This article belongs to the Special Issue Process Mining and Emerging Applications)
Since their introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a (mathematical) tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. Translation of a process tree into a sound workflow net is trivial. However, the reverse is not the case. Simultaneously, an algorithm that translates a WF-net into a process tree is of great interest, e.g., the explicit knowledge of the control-flow hierarchy in a WF-net allows one to reason on its behavior more easily. Hence, in this paper, we present such an algorithm, i.e., it detects whether a WF-net corresponds to a process tree, and, if so, constructs it. We prove that, if the algorithm finds a process tree, the language of the process tree is equal to the language of the original WF-net. The experiments conducted show that the algorithm’s corresponding implementation has a quadratic time complexity in the size of the WF-net. Furthermore, the experiments show strong evidence of process tree rediscoverability. View Full-Text
Keywords: process trees; Petri nets; workflow nets; process mining process trees; Petri nets; workflow nets; process mining
Show Figures

Figure 1

MDPI and ACS Style

van Zelst, S.J.; Leemans, S.J.J. Translating Workflow Nets to Process Trees: An Algorithmic Approach. Algorithms 2020, 13, 279.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop