识别业务流程中活动环的新方法:字符串可达矩阵

可达矩阵只能表达两个节点之间的可以达到的关系,环的识别需通过对矩阵的观察进行,当矩阵阶数较高时会相应增加环的识别难度.在可达矩阵的基础上提出了一种寻找不合理活动环的新方法字符串可达矩阵.该方法将字符串引入到可达矩阵中,从而可以在矩阵中显示出活动环及活动路径.详细描述了该方法所涉及的定义及运算规则,最后用实例解释了该方法的计算步骤、以及如何快速地找到了活动环及活动路径,为业务流程再造提供了一种新的解决方案.

New Approach to Identify Activity Loops in Business Process: String Reachable Matrix

The reachable matrix can only express the reachable relationship between two nodes, but observing the matrix is needed for identifying loops to which the higher the order of matrix, the harder the identification of loops. Based on reachable matrix, a new approach is proposed to seek for unreasonable activity loops, i. e., the string reachable matrix (SRM). Showing the activity loops/paths in a matrix is therefore available via introducing strings into the matrix. Definitions and operational rules relevant to SRM are described in detail. The computing steps of SRM and how SRM finds out the activity loops/paths so quickly are exemplified. As one of the solutions to BPR, SRM provides a new way.