An Alternative Way to Analyze Workflow Graphs

  • Authors:
  • Wil M. P. van der Aalst;Alexander Hirnschall;H. M. W. (Eric) Verbeek

  • Affiliations:
  • -;-;-

  • Venue:
  • CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

At the CAiSE conference in Heidelberg in 1999, Wasim Sadiq andMaria Orlowska presented an algorithm to verify workflow graphs [19]. The algorithm uses a set of reduction rules to detect structural conflicts. This paper shows that the set of reduction rules presented in [19] is not complete and proposes an alternative algorithm. The algorithm translates workflow graphs into so-called WF-nets. WF-nets are a class of Petri nets tailored towards workflow analysis. As a result, Petri-net theory and tools can be used to verify workflow graphs. In particular, our workflow verification tool Woflan [21] can be used to detect design errors. It is shown that the absence of structural conflicts, i.e., deadlocks and lack of synchronization, conforms to soundness of the corresponding WF-net [2]. In contrast to the algorithm presented in [19], the algorithm presented in this paper is complete. Moreover, the complexity of this alternative algorithm is given.