关键词: 工作流, 有向图, 工作流验证

Abstract: Since the structural conflicts in workflow processes can lead to malfunction of workflow management systems，the problem should be detected before workflow processes are put into execution.Up to now，workflow verification without cycles is well solved in Mahanti-Sinnakkrishnan algorithm.L.Kai and L.Qing proposed an algorithm called CWRS to verify workflow graphs which may have cycles，but it has some deficencies which can lead to misjudgment.This paper mainly analyzes the CWRS algorithm，and points the deficencies，then proposes an improved method to completely solve the structural conflicts even if unpaired AND nodes exist in the loop.

Key words: workflow, directed graph, workflow verification