A graph-search based algorithm for verifying workflow graphs

Structural conflicts in workflow processes can lead to malfunctioning of workflow management systems. Workflow verification is performed to detect the structural conflicts in the workflow processes. In this paper, we have proposed a new workflow verification algorithm called "Mahanti-Sinnakkrishnan" algorithm. This algorithm is graph-search based and can verify workflow processes represented as workflow graphs. Computational complexity of this algorithm is O(E²), where E refers to number of edges in workflow graphs. This algorithm is simpler and more efficient than the existing algorithms for workflow verification.