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

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

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

55 Citations (Scopus)

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-joins 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.
Original languageEnglish
Title of host publicationApplications and theory of Petri Nets 2005 : 26th international conference, ICATPN 2005, Miami, USA, June 20 - 25, 2005 ; proceedings
EditorsG. Ciardo, P. Darondeau
Place of PublicationBerlin
PublisherSpringer
Pages423-443
ISBN (Print)978-3-540-26301-2
DOIs
Publication statusPublished - 2005
Event26th International Concerence on Application and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2005 - Miami, United States
Duration: 20 Jun 200525 Jun 2005
Conference number: 26

Publication series

NameLecture Notes in Computer Science
Volume3536
ISSN (Print)0302-9743

Conference

Conference26th International Concerence on Application and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2005
Abbreviated titleICATPN 2005
Country/TerritoryUnited States
CityMiami
Period20/06/0525/06/05

Fingerprint

Dive into the research topics of 'Achieving a general, formal and decidable approach to the OR-join in workflow using reset nets'. Together they form a unique fingerprint.

Cite this