Reduction rules for YAWL workflows with cancellation regions and OR-joins
Data(s) |
2009
|
---|---|
Resumo |
As the need for concepts such as cancellation and OR-joins occurs naturally in business scenarios, comprehensive support in a workflow language is desirable. However, there is a clear trade-off between the expressive power of a language (i.e., introducing complex constructs such as cancellation and OR-joins) and ease of verification. When a workflow contains a large number of tasks and involves complex control flow dependencies, verification can take too much time or it may even be impossible. There are a number of different approaches to deal with this complexity. Reducing the size of the workflow, while preserving its essential properties with respect to a particular analysis problem, is one such approach. In this paper, we present a set of reduction rules for workflows with cancellation regions and OR-joins and demonstrate how they can be used to improve the efficiency of verification. Our results are presented in the context of the YAWL workflow language. |
Identificador | |
Publicador |
Elsevier BV |
Relação |
DOI:10.1016/j.infsof.2008.12.002 Wynn, Moe, Verbeek, Eric, van der Aalst, Wil, ter Hofstede, Arthur, & Edmond, David (2009) Reduction rules for YAWL workflows with cancellation regions and OR-joins. Information and Software Technology, 51(6), pp. 1010-1020. |
Fonte |
Faculty of Science and Technology; School of Information Systems |
Palavras-Chave | #080300 COMPUTER SOFTWARE #080600 INFORMATION SYSTEMS #080699 Information Systems not elsewhere classified #Verification of Process Models, Soundness Property, Reduction Rules, Cancellation, Or-Join, Reset Nets |
Tipo |
Journal Article |