论文标题
将工作流网的转换为处理树：一种算法方法
Translating Workflow Nets to Process Trees: An Algorithmic Approach
论文作者
论文摘要
自最近引入以来，过程树在许多过程挖掘算法中经常被用作过程建模形式主义。过程树是一个基于树的过程的模型，其中内部顶点代表行为控制流的关系和叶子代表过程活动。过程树很容易被翻译成声流网（WF-net），但是，情况并非如此。然而，将WF-NET转换为过程树的算法引起了人们的极大兴趣，例如，WF-NET中对控制流层次结构的明确知识使人们可以更轻松地了解其行为。因此，在本文中，我们提出了这样的算法，即它检测到wf-net是否对应于过程树，如果是的，则构建它。我们证明，如果发现过程树，则过程树的语言等于原始WF-net的语言。进行的实验表明，该算法的相应实现具有二次时复杂性，其大小在WF-NET的大小中具有。此外，实验显示了过程树重新发现性的有力证据。
Since their recent introduction, process trees have been frequently used as a process modeling formalism in many process mining algorithms. A process tree is a tree-based model of a process, in which internal vertices represent behavioral control-flow relations and leaves represent process activities. A process tree is easily translated into a sound Workflow net (WF-net), however, the reverse is not the case. Yet, 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 more easily reason on its behavior. 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 a process tree is discovered, the language of the process tree equals the language of the original WF-net. Conducted experiments 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.
