突破极限:在无环声音自由选择工作流网中检测并发性在O(P² + T²)
Pushing the Limits: Concurrency Detection in Acyclic Sound Free-Choice Workflow Nets in $O(P^2 + T^2)$
AI总结:
本文提出了一种在无环声音自由选择工作流网中以O(P² + T²)复杂度检测并发性的CP算法,提升并发性分析效率。
摘要:
并发性是Petri网中描述和模拟复杂系统行为的重要方面。知道哪些地方和转换可以并行执行有助于理解网络,并启用分析技术和计算其他属性,如因果性、排他性等。所有基于并发性检测的技术都依赖于这种检测方法的效率。Kovalyov和Esparza开发了计算所有并发地点的算法,在活的和有界的网络中复杂度为O((P+T)TP²),在活的和有界的自由选择网络中复杂度为O(P(P+T)²)。尽管这些算法有相当好的计算复杂度,但大量并发节点对仍可能导致长时间的计算时间。本文通过为声音自由选择工作流网补充并发路径(CP)算法来扩展并发性检测算法的 palette。该算法允许并行处理,并且在无环网络中的最坏计算复杂度为O(P² + T²),在有环网络中的最坏计算复杂度为O(P³ + PT²)。虽然有环网络的计算复杂度没有改善,但评估显示了CP算法的优势,特别是当网络包含许多并发关系的节点时。
英文摘要:
Concurrency is an important aspect of Petri nets to describe and simulate the behavior of complex systems. Knowing which places and transitions could be executed in parallel helps to understand nets and enables analysis techniques and the computation of other properties, such as causality, exclusivity, etc.. All techniques based on concurrency detection depend on the efficiency of this detection methodology. Kovalyov and Esparza have developed algorithms that compute all concurrent places in $O\big((P+T)TP^2\big)$ for live and bounded nets (where $P$ and $T$ are the numbers of places and transitions) and in $O\big(P(P+T)^2\big)$ for live and bounded free-choice nets. Although these algorithms have a reasonably good computational complexity, large numbers of concurrent pairs of nodes may still lead to long computation times. This paper complements the palette of concurrency detection algorithms with the Concurrent Paths (CP) algorithm for sound free-choice workflow nets. The algorithm allows parallelization and has a worst-case computational complexity of $O(P^2 + T^2)$ for acyclic nets and of $O(P^3 + PT^2)$ for cyclic nets. Although the computational complexity of cyclic nets has not improved, the evaluation shows the benefits of CP, especially, if the net contains many nodes in concurrency relation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。