Abstract: Bussiness process modeling, analysis and optimization are the important foundations of BPR, the efficient and effective analytical method plays a key role in model analysis. In this paper, according to the characteristics of workflow model for business process, a Petri net based verification approach that employs a set of graph reduction rules is proposed. The completeness and polynomial time complexity properties of the proposed method are proved. A case study is made to demonstrate our method.