Cart (Loading....) | Create Account
Close category search window
 

A New Algorithm Based Graph-Search for Workflow Verification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhongjun Du ; Sch. of Comput. Sci., Sichuan Univ., Chengdu, China ; Zhengjun Dang

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.

Published in:

Information Engineering and Computer Science (ICIECS), 2010 2nd International Conference on

Date of Conference:

25-26 Dec. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.