35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 Big Island, Hawaii January 07-January 10 ISBN: 0-7695-1435-9
The algorithm [1] is based on a set of graph reduction rules to identify the deadlock and lack of synchronization conflicts that could compromise the correct execution of a workflow. However, an example, which is apparently correct but cannot be reduced by the rules, shows the incompleteness of the algorithm. In this paper, we present a complete and minimal set of rules and a novel algorithm to implement the identification of structural conflicts in process models. The correctness and completeness of the algorithm is strictly proved. Finally, the complexity of the algorithm is analyzed.
Index Terms:
Business Process Modeling, Verification of Process Models, Workflow Management Systems
Citation:
H. Lin, Z. Zhao, H. Li, Z. Chen, "A Novel Graph Reduction Algorithm to Identify Structural Conflicts," hicss, vol. 9, pp.289, 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9, 2002 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb