An efficient algorithm for workflow graph structural verification - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

An efficient algorithm for workflow graph structural verification

Résumé

Any big enterprise is organized around business process hav- ing 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 al- gorithm will be disussed and compared to existing workflow structural checking approaches from completeness and performance points of view.
Fichier non déposé

Dates et versions

inria-00325187 , version 1 (26-09-2008)

Identifiants

  • HAL Id : inria-00325187 , version 1

Citer

Fodé Touré, Karim Baïna, Khalid Benali. An efficient algorithm for workflow graph structural verification. Coopis 2008 (16th International Conference on cooperative information systems, On the Move, Nov 2008, Monterrey, Mexico. ⟨inria-00325187⟩
282 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More