Achieving a general, formal and decidable approach to the OR-Join in workflow using reset nets

  • Authors:

  • Moe Thandar Wynn;David Edmond;W. M. P. van der Aalst;A. H. M. ter Hofstede

  • Affiliations:

  • Center for IT Innovation, Queensland University of Technology, Brisbane, Qld, Australia;Center for IT Innovation, Queensland University of Technology, Brisbane, Qld, Australia;Center for IT Innovation, Queensland University of Technology, Brisbane, Qld, Australia;Center for IT Innovation, Queensland University of Technology, Brisbane, Qld, Australia

  • Venue:
  • ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Workflow languages offer constructs for coordinating tasks. Among these constructs are various types of splits and joins. One type of join, which shows up in various incarnations, is the OR-join. Different approaches assign a different (often only intuitive) semantics to this type of join, though they do share the common theme that synchronisation is only to be performed for active threads. Depending on context assumptions this behaviour may be relatively easy to deal with, though in general its semantics is complicated, both from a definition point of view (in terms of formally capturing a desired intuitive semantics) and from a computational point of view (how does one determine whether an OR-join is enabled?). In this paper the concept of OR-join is examined in detail in the context of the workflow language YAWL, a powerful workflow language designed to support a collection of workflow patterns and inspired by Petri nets. The OR-join's definition is adapted from an earlier proposal and an algorithmic approach towards determining OR-join enablement is examined. This approach exploits a link that is proposed between YAWL and Reset nets, a variant of Petri nets with a special type of arc that can remove all tokens from a place.