SYNCHRONIZATION AND CANCELATION IN WORKFLOWS BASED ON RESET NETS
| Autor: | van der Wmp Wil Aalst, David Edmond, A.H.M. ter Hofstede, Moe Thandar Wynn |
|---|---|
| Přispěvatelé: | Information Systems IE&IS, Process Science |
| Rok vydání: | 2009 |
| Předmět: |
Computer science
Programming language Semantics (computer science) Formal semantics (linguistics) Joins Context (language use) Petri net computer.software_genre Computer Science Applications OR-join Synchronizing Merge Cancelation YAWL Workflow Patterns Reset Nets Workflow 170200 COGNITIVE SCIENCE Synchronization (computer science) 080699 Information Systems not elsewhere classified Reset (computing) computer 080600 INFORMATION SYSTEMS Information Systems |
| Zdroj: | International Journal of Cooperative Information Systems International Journal of Cooperative Information Systems, 18(1), 63-114. World Scientific |
| ISSN: | 1793-6365 0218-8430 |
| Popis: | 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 branches that cannot complete will not be waited for. Many systems and languages struggle with the semantics and implementation of the OR-join because its non-local semantics require a synchronization depending on the analysis of future execution paths. The presence of cancelation features, potentially unbounded behavior, and other OR-joins in a workflow further complicates the formal semantics of the OR-join. In this paper, the concept of the 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 paper provides a suitable (non-local) semantics for an OR-join and gives a concrete algorithm with two optimization techniques to support the implementation. 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 when its transition fires. Through the behavior of reset arcs, the behavior of cancelation regions can be captured in a natural manner. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|