Applying Graph Search Techniques for Workflow Verification

Authors:
Sinnakkrishnan Perumal;Ambuj Mahanti
Affiliations:
Indian Institute of Management Calcutta;Indian Institute of Management Calcutta
Venue:
HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
Year:
2007

Citing 0
Cited 3

An Efficient Algorithm for Workflow Graph Structural Verification

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:
Investigations on Stochastic Information Control Nets

Information Sciences: an International Journal
Generalized aggregate Quality of Service computation for composite services

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Workflow verification is a critical topic in workflow management. This involves identifying structural conflicts in the workflow process definition. Mahanti- Sinnakkrishnan algorithm is a graph-search based algorithm for verifying workflow graphs and this algorithm is given in [5] and [6]. In this paper, intricacies of this algorithm in using typical graph search techniques for solving the problem of workflow verification are detailed. AO* and Depth First Search are the two graph search techniques used in this algorithm.