An Algorithm Combining Graph-Reduction and Graph-Search for Workflow Graphs Verification

Since the structural conflicts in workflow processes can lead to malfunctioning of workflow management systems, the problem should be detected before workflow processes are put into execution. In this paper, we propose a combined graph-reduction and graph-search algorithm "CWRS" to verify workflow graphs. This algorithm reduces a cyclic workflow graph to an acyclic workflow graph, and then verifies this acyclic workflow graph by using Mahanti-Sinnakkrishnan algorithm. Computational complexity of this algorithm is 0(E), where E refers to number of edges in a workflow graph. In comparison with others, our algorithm can verify both cyclic and acyclic workflow graphs.