A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Circuits, handles, bridges and nets
APN 90 Proceedings on Advances in Petri nets 1990
Reduction and synthesis of live and bounded free choice Petri nets
Information and Computation
Free choice Petri nets
Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
Journal of the ACM (JACM)
Analyzing process models using graph reduction techniques
Information Systems - The 11th international conference on advanced information systems engineering (CAiSE*
Relaxed Soundness of Business Processes
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques
Business Process Management, Models, Techniques, and Empirical Studies
Empirical Studies in Process Model Verification
Transactions on Petri Nets and Other Models of Concurrency II
The refined process structure tree
Data & Knowledge Engineering
Instantaneous Soundness Checking of Industrial Business Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
The difficulty of replacing an inclusive OR-join
BPM'12 Proceedings of the 10th international conference on Business Process Management
| Hi-index | 0.00 |
We propose a new technique to analyze the control-flow, i.e., the workflow graph of a business process model, which we call symbolic execution. We consider acyclic workflow graphs that may contain inclusive OR gateways and define a symbolic execution for them that runs in quadratic time. The result allows us to decide in quadratic time, for any pair of control-flow edges or tasks of the workflow graph, whether they are sometimes, never, or always reached concurrently. This has different applications in finding control- and data-flow errors. In particular, we show how to decide soundness of an acyclic workflow graph with inclusive OR gateways in quadratic time. Moreover, we show that symbolic execution provides diagnostic information that allows the user to efficiently deal with spurious errors that arise due to over-approximation of the data-based decisions in the process.