基于实例分解的工作流授权合理性验证  

Verification of workflow authorization reasonability based on business instance decomposition

作　　者：欧阳昱[1] 刘玉树[1] 

机构地区：[1]北京理工大学信息科学技术学院,北京100081

出　　处：《计算机集成制造系统》2006年第5期697-701,共5页Computer Integrated Manufacturing Systems

基　　金：国家"十五"科技攻关计划课题资助项目(2001BA105A1006)~~

摘　　要：为提高工作流授权合理性验证的效率,增强对执行时任务指派的支持,提出了基于问题分解的工作流授权合理性验证方法。通过基于业务实例的工作流模型分解,将工作流授权合理性问题分解为业务实例、业务实例的并发任务集合、并发任务集合中任务的授权合理性问题,得到工作流授权合理性问题的与/或树表示。利用定义的合理指派路径及其串联操作,分析了工作流授权合理性问题与/或树节点的可解性。给出了基于与/或树搜索实现工作流授权合理性验证的算法,并分析了算法的复杂度及其输出的合理指派路径对工作流执行时任务指派的支持。在与/或树基础上,通过选择合适的启发函数,可以进一步提高验证效率,或快速生成适合问题需求的最佳解树。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.

关 键 词：工作流 授权约束 任务指派 合理性 验证 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]