Workflow completion patterns

Authors:
Nikola Trčka;Wil van der Aalst;Natalia Sidorova
Affiliations:
Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands
Venue:
CASE'09 Proceedings of the fifth annual IEEE international conference on Automation science and engineering
Year:
2009

Citing 7
Cited 0

Fairness

Fairness
Model checking

Model checking
From Business Process Model to Consistent Implementation: A Case for Formal Verification Methods

EDOC '02 Proceedings of the 6th International Enterprise Distributed Object Computing Conference
Model Checking of Workflow Schemas

EDOC '00 Proceedings of the 4th International conference on Enterprise Distributed Object Computing
Relaxed Soundness of Business Processes

CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
Symbolic model checking of UML activity diagrams

ACM Transactions on Software Engineering and Methodology (TOSEM)
Investigations on soundness regarding lazy activities

BPM'06 Proceedings of the 4th international conference on Business Process Management

Quantified Score

Hi-index	0.01

Visualization

Abstract

The most common correctness requirement for a (business) workflow is the completion requirement, imposing that, in some form, every case-instance of the workflow reaches its final state. In this paper, we define three workflow completion patterns, called the mandatory, optional and possible completion. These patterns are formalized in terms of the temporal logic CTL*, to remove ambiguities, allow for easy comparison, and have direct applicability. In contrast to the existing methods, we do not look at the control flow in isolation but include some data information as well. In this way the analysis remains tractable but gains precision. Together with our previous work on data-flow (anti-)patterns, this paper is a significant step towards a unifying framework for complete workflow verification, using the well-developed, stable, adaptable, and effective model-checking approach.