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

可靠自由选择工作流网并发阈值的计算

Computing the concurrency threshold of sound free-choice workflow nets

Philipp J. Meyer, Javier Esparza, Hagen Völzer

摘要:

工作流图扩展了经典的流程图,增加了并发的fork和join节点。它们构成了诸如BPMN或UML活动图等业务处理语言的核心。工作流图的活动由人或机器执行,一般称为资源。如果由于缺乏资源而无法并行执行并发活动,则执行工作流所需的时间会增加。我们研究了计算充分利用给定工作流的并发性所需的最小资源数量的问题,并尽可能快地执行它(即,与无限资源一样快)。我们使用自由选择Petri网,这是已知的等价于工作流图模型这个问题。我们分析了两个版本的问题的计算复杂性:计算资源和并发阈值。我们使用的结果来设计一个算法来近似的并发阈值,并评估它的基准套件的642个工业实例。我们表明,它在实践中表现得非常好:它总是提供确切的值,并且对于任何工作流都不会超过30毫秒,即使对于那些具有大量可达标记的工作流也是如此。

英文摘要:

Workflow graphs extend classical flow charts with concurrent fork and join nodes. They constitute the core of business processing languages such as BPMN or UML Activity Diagrams. The activities of a workflow graph are executed by humans or machines, generically called resources. If concurrent activities cannot be executed in parallel by lack of resources, the time needed to execute the workflow increases. We study the problem of computing the minimal number of resources necessary to fully exploit the concurrency of a given workflow, and execute it as fast as possible (i.e., as fast as with unlimited resources). We model this problem using free-choice Petri nets, which are known to be equivalent to workflow graphs. We analyze the computational complexity of two versions of the problem: computing the resource and concurrency thresholds. We use the results to design an algorithm to approximate the concurrency threshold, and evaluate it on a benchmark suite of 642 industrial examples. We show that it performs very well in practice: It always provides the exact value, and never takes more than 30 milliseconds for any workflow, even for those with a huge number of reachable markings.

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

↑