An efficient algorithm for workflow graph structural verification

Abstract

Any big enterprise is organized around business process having a value towards its customers and its products. Appropriate definition, analysis, checking and improvement of those business process models are indispensable before their deployment within workflow management systems. In this paper, we focus on business process model verification that insures business process structural correctness. Our proposal consist in a new efficient hybrid algorithm of workflow graph structural validation combining graph reduction and traversal mechanisms. Our algorithm will be disussed and compared to existing workflow structural checking approaches from completeness and performance points of view. © 2008 Springer Berlin Heidelberg.