Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Reset Nets and Reachability Analysis
Wynn, Moe T., van der Aalst, Wil M., ter Hofstede, Arthur H.M., & Edmond, David (2006) Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Reset Nets and Reachability Analysis. In Business Process Management Conference, September 2006, Vienna, Austria.
![]() | There is a more recent version of this eprint available. Click here to view it. |
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.
Citations:
Citation countsare 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.
| ID Code: | 10019 |
|---|---|
| Item Type: | Conference Paper |
| Keywords: | Workflow verification, Cancellation, OR, joins, Reset nets, YAWL |
| DOI: | 10.1007/11841760_28 |
| ISBN: | 9783540389019 |
| ISSN: | 1611-3349 |
| 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 |
| Copyright Owner: | Copyright 2006 Springer |
| Copyright Statement: | This is the author-version of the work. Conference proceedings published, by Springer Verlag, will be available via SpringerLink. http://www.springer.de/comp/lncs/ Lecture Notes in Computer Science |
| Deposited On: | 08 Oct 2007 |
| Last Modified: | 20 May 2010 01:57 |
Available Versions of this Item
- Verifying Workflows with Cancellation Regions and OR-joins: An Approach Based on Reset Nets and Reachability Analysis. (deposited 08 Oct 2007)[Currently Displayed]
Export: EndNote | Dublin Core | BibTeX
Staff only: HERDC collection form
Repository Staff Only: item control page
