An efficient algorithm for workflow graph structural verification - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

An efficient algorithm for workflow graph structural verification

(1) , (1) , (2)
1
2

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.
Not file

Dates and versions

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

Identifiers

  • HAL Id : inria-00325187 , version 1

Cite

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⟩
291 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More