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

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

15 Citaten (Scopus)

Samenvatting

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.
Originele taal-2Engels
TitelBusiness Process Management (Proceedings 4th International Conference, BPM 2006, Vienna, Austria, September 5-7, 2006)
RedacteurenS. Dustdar, J.L. Fiadeiro, A. Sheth
Plaats van productieBerlin
UitgeverijSpringer
Pagina's389-394
ISBN van geprinte versie3-540-38901-6
DOI's
StatusGepubliceerd - 2006

Publicatie series

NaamLecture Notes in Computer Science
Volume4102
ISSN van geprinte versie0302-9743

Vingerafdruk

Duik in de onderzoeksthema's van 'Verifying workflows with cancellation regions and OR-joins : an approach based on reset nets and reachability analysis'. Samen vormen ze een unieke vingerafdruk.

Citeer dit