关键词: 作流, 授权约束, 与/或树, 任务指派, 合理性

Abstract: In order to improve the verification efficiency of Workflow Authorization Reasonability (WAR) and enhance supporting task assignment at operation time,the WAR verification method based on problem decomposition was proposed. By decomposing workflow model based on their business instances,the verification of WAR was reduced to that of its business instances,the parallel task sets of the business instances and the tasks authorization reasonability in the parallel task set,thus the corresponding And/Or tree notation was obtained. Using the defined reasonable task assignment path and its concatenate operation,the solution of And/Or tree of WAR was studied. Based on And/Or tree search,the verification algorithms of WAR and its business instance were given. The complexities of algorithms were analyzed. Using the obtained rational task assignment paths,the running-time task assignment of the workflow could be directed. In the conclusion,it was pointed out that more efficient verification algorithms of WAR could be acquired or a best solution tree could be generated speedily based on the proposed And/Or tree and the special heuristic function.

Key words: workflow, authorization constraint, And/Or tree, task assignment, reasonability