arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.08213cs.LO
收藏

工作流网到过程树的转换:一种数学方法

Translating Workflow Nets to Process Trees: An Algorithmic Approach

Sebastiaan J. van Zelst

摘要:

自从他们最近的介绍,过程树已被频繁地使用作为一个过程建模的形式主义在许多过程挖掘算法。流程树是一种基于树的流程模型,其中内部顶点表示行为控制流关系,叶子表示流程活动。一个过程树很容易转化为一个健全的工作流网(WF网),然而,反过来就不是这样了。然而,将工作流网转换为进程树的算法是非常有趣的,例如,工作流网中控制流层次结构的明确知识允许人们更容易地对其行为进行推理。因此,在本文中,我们提出了这样一个算法,即,它检测一个工作流网是否对应于一个进程树,如果是,则构造它。我们证明,如果进程树被发现,进程树的语言等于原始工作流网的语言。实验表明,该算法的相应实现具有二次的时间复杂度的工作流网的大小。此外,实验显示了强有力的证据,过程树的可重用性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑