An Efficient Algorithm for Workflow Graph Structural Verification

  • Authors:
  • Fodé Touré;Karim Baïna;Khalid Benali

  • Affiliations:
  • ENSIAS, University Mohammed V-Souissi, Agdal, Morocco;ENSIAS, University Mohammed V-Souissi, Agdal, Morocco;LORIA - INRIA - CNRS - UMR 7503, Vandœuvre-lès-Nancy Cedex, France F-54506

  • Venue:
  • OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems:
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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.