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

21Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Wynn, M. T., Van Der Aalst, W. M. P., Ter Hofstede, A. H. M., & Edmond, D. (2006). Verifying workflows with cancellation regions and OR-joins: An approach based on reset nets and reachability analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4102 LNCS, pp. 389–394). Springer Verlag. https://doi.org/10.1007/11841760_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free