Abstract
Structural conflicts in workflow processes can lead to malfunctioning of workflow management systems. Workflow verification is performed to detect the structural conflicts in the workflow processes. In this paper, we have proposed a new workflow verification algorithm called Mahanti-Sinnakkrishnan algorithm. This algorithm is graph-search based and can verify workflow processes represented as workflow graphs. Computational complexity of this algorithm is O(E/sup 2/), where E refers to number of edges in workflow graphs. This algorithm is simpler and more efficient than the existing algorithms for workflow verification.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
