Reduction rules for YAWL workflows with cancellation regions and OR-joins

  • Authors:

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

  • Affiliations:

  • Business Process Management Group, Queensland University of Technology, GPO Box 2434, Brisbane QLD 4001, Australia;Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands;Business Process Management Group, Queensland University of Technology, GPO Box 2434, Brisbane QLD 4001, Australia and Department of Mathematics and Computer Science, Eindhoven University of Techn ...;Business Process Management Group, Queensland University of Technology, GPO Box 2434, Brisbane QLD 4001, Australia;Business Process Management Group, Queensland University of Technology, GPO Box 2434, Brisbane QLD 4001, Australia

  • Venue:
  • Information and Software Technology
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language.