An efficient algorithm for workflow graph structural verification

Fodé Touré 1 Karim Baïna 1 Khalid Benali 2
2 ECOO - Environment for cooperation
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00325187
Contributor : Khalid Benali <>
Submitted on : Friday, September 26, 2008 - 3:05:40 PM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM

Identifiers

  • HAL Id : inria-00325187, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

448