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

Wynn, Moe T., Edmond, David, ter Hofstede, Arthur H.M., & van der Aalst, Wil M. (2005) Achieving a general, formal, and decidable approach to the OR-join in workflow using reset nets. Lecture Notes in Computer Science, 3536, pp. 423-443.

This is the latest version of this eprint.

View at publisher


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.

Impact and interest:

47 citations in Scopus
34 citations in Web of Science®
Search Google Scholar™

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

Full-text downloads:

60 since deposited on 30 May 2007
12 in the past twelve months

Full-text downloads displays the total number of times this work’s files (e.g., a PDF) have been downloaded from QUT ePrints as well as the number of downloads in the previous 365 days. The count includes downloads for all files if a work has more than one.

ID Code: 7930
Item Type: Journal Article
Refereed: Yes
Additional Information:

For more information, please refer to the publisher's website (see link) or contact the author. Author contact details:

Applications and Theory of Petri Nets 2005: 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005. Proceedings

Keywords: OR, join, YAWL, Workflow patterns, synchronizing merge, Petri nets, Reset nets
DOI: 10.1007/11494744_24
ISBN: ISSN 9783540263012
ISSN: 0302-9743
Subjects: Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600) > Information Systems not elsewhere classified (080699)
Divisions: Past > QUT Faculties & Divisions > Faculty of Science and Technology
Current > Schools > School of Information Systems
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2005 Springer
Copyright Statement: This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink. Lecture Notes in Computer Science
Deposited On: 30 May 2007 00:00
Last Modified: 20 Aug 2013 04:25

Available Versions of this Item

  • Achieving a general, formal, and decidable approach to the OR-join in workflow using reset nets. (deposited 30 May 2007 00:00) [Currently Displayed]

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page