Verifying workflows with cancellation regions and OR-Joins: an approach based on reset nets and reachability analysis

  • Authors:

  • M. T. Wynn;W. M. P. van der Aalst;A. H. M. ter Hofstede;D. Edmond

  • Affiliations:

  • Queensland University of Technology, Australia;Queensland University of Technology, Australia;Queensland University of Technology, Australia;Queensland University of Technology, Australia

  • Venue:
  • BPM'06 Proceedings of the 4th international conference on Business Process Management
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

When dealing with complex business processes (e.g., in the context of a workflow implementation or the configuration of some process-aware information system), it is important but sometimes difficult to determine whether a process contains any errors. The concepts such as cancellation and OR-joins occur naturally in business scenarios but the presence of these features in process models poses new challenges for verification. We take on the challenge of finding new verification techniques for workflows with cancellation regions and OR-joins. The proposed approach relies on reset nets and reachability analysis. We present these techniques in the context of workflow language YAWL that provides direct support for these features. We have extended the graphical editor of YAWL with these diagnostic features.