在工作流网中寻找AND-OR层次结构
Finding AND-OR Hierarchies in Workflow Nets
摘要:
本文提出了AND-OR约简的概念,它通过迭代地将某些良好形式的矩阵收缩为单个节点,直到不再可能进行这种收缩,从而将WF网约简为更小的网。这种约简可以揭示WF网的层次结构,并且由于它保留了某些语义属性,例如可靠性,因此它可以帮助分析和理解为什么WF网是可靠的。这种归约也可以用来验证WF网是否是AND-OR网。这类WF网在早期的工作中被引入,并且可以说描述了遵循良好的分层设计原则的网。结果表明,与或约简是融合的同构,这意味着,尽管固有的非确定性,来自收缩的选择,减少的最终结果总是相同的选择的身份的节点。基于这个结果,提出了一个多项式时间算法,计算这个唯一的结果的AND或减少。最后,它示出了如何使用该算法来验证如果WF网是一个AND-OR网。
英文摘要:
This paper presents the notion of AND-OR reduction, which reduces a WF net to a smaller net by iteratively contracting certain well-formed subnets into single nodes until no more such contractions are possible. This reduction can reveal the hierarchical structure of a WF net, and since it preserves certain semantical properties such as soundness, it can help with analysing and understanding why a WF net is sound or not. The reduction can also be used to verify if a WF net is an AND-OR net. This class of WF nets was introduced in earlier work, and arguably describes nets that follow good hierarchical design principles. It is shown that the AND-OR reduction is confluent up to isomorphism, which means that despite the inherent non-determinism that comes from the choice of subnets that are contracted, the final result of the reduction is always the same up to the choice of the identity of the nodes. Based on this result, a polynomial-time algorithm is presented that computes this unique result of the AND-OR reduction. Finally, it is shown how this algorithm can be used to verify if a WF net is an AND-OR net.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。