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

工作流网可靠性的复杂性

The complexity of soundness in workflow nets

Michael Blondin, Filip Mazowiecki, Philip Offtermatt

摘要:

工作流网是Petri网的一种流行变体,它允许对业务流程进行算法形式化分析。关于工作流网的中心决策问题处理的合理性,其中指定的初始和最终配置。直觉上,可靠性表明,从每一个可达到的配置,都可以达到最终的配置。我们解决了广泛开放的复杂性的三个主要变量的健全:古典,结构和广义健全。前两个是EXPSPACE完备的,令人惊讶的是,后者是PSPACE完备的,因此计算更简单。

英文摘要:

Workflow nets are a popular variant of Petri nets that allow for algorithmic formal analysis of business processes. The central decision problems concerning workflow nets deal with soundness, where the initial and final configurations are specified. Intuitively, soundness states that from every reachable configuration one can reach the final configuration. We settle the widely open complexity of the three main variants of soundness: classical, structural and generalised soundness. The first two are EXPSPACE-complete, and, surprisingly, the latter is PSPACE-complete, thus computationally simpler.

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

↑