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.
In REF it is shown that the backward reachability graph can be used to determine the enabling of OR-joins in the context of cancelation.
Verifying Workflows with Cancellation Regions and OR-joins : An Approach Based on Reset Nets and Reachability Analysis
ICALP
Computer Science