Verifying workflows with cancellation regions and OR-joins : an approach based on reset nets and reachability analysis

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

15 Citations (Scopus)

Abstract

When dealing with complex business processes (e.g., in the context of a workflow implementation or the configuration of some process-aware information system), it is important but sometimes difficult to determine whether a process contains any errors. The concepts such as cancellation and OR-joins occur naturally in business scenarios but the presence of these features in process models poses new challenges for verification. We take on the challenge of finding new verification techniques for workflows with cancellation regions and OR-joins. The proposed approach relies on reset nets and reachability analysis. We present these techniques in the context of workflow language YAWL that provides direct support for these features. We have extended the graphical editor of YAWL with these diagnostic features.
Original languageEnglish
Title of host publicationBusiness Process Management (Proceedings 4th International Conference, BPM 2006, Vienna, Austria, September 5-7, 2006)
EditorsS. Dustdar, J.L. Fiadeiro, A. Sheth
Place of PublicationBerlin
PublisherSpringer
Pages389-394
ISBN (Print)3-540-38901-6
DOIs
Publication statusPublished - 2006

Publication series

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

Fingerprint

Dive into the research topics of 'Verifying workflows with cancellation regions and OR-joins : an approach based on reset nets and reachability analysis'. Together they form a unique fingerprint.

Cite this