A New Algorithm Based Graph-Search for Workflow Verification

In many circumstances, the structural conflicts in workflow processes lead to malfunctioning of workflow management systems. So the conflicts should be detected and resolved before workflow processes are actually put into execution. Up to now, there is still no effective algorithm which can be able...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Information Engineering and Computer Science pp. 1 - 3
Main Authors Zhongjun Du, Zhengjun Dang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Algorithm design and analysis
Approximation algorithms
Complexity theory
Image edge detection
Synchronization
System recovery
Workflow management software
Online AccessGet full text

Cover

More Information
Summary:In many circumstances, the structural conflicts in workflow processes lead to malfunctioning of workflow management systems. So the conflicts should be detected and resolved before workflow processes are actually put into execution. Up to now, there is still no effective algorithm which can be able to detect out the structural conflicts both in the workflow without loop and in the workflow with loop. This paper proposed a new algorithm which transforms the loop in the workflow to an acyclic sub-graph and can detect out the structural conflicts in the workflow even with loop.
ISBN:1424479398
9781424479399
ISSN:2156-7379
DOI:10.1109/ICIECS.2010.5677734