基于与或图的Web服务自动组合  

Automatic web services composition based on and/or graph

作　　者：叶恒舟[1] 罗晓娟[1] 牛秦洲[1] 

机构地区：[1]桂林理工大学信息科学与工程学院,广西桂林541004

出　　处：《计算机工程与设计》2010年第11期2645-2647,2653,共4页Computer Engineering and Design

基　　金：广西科学研究与技术开发计划基金项目(桂科攻0992006-1)

摘　　要：为快速、灵活、高效地组合Web服务,通过论证与或图的重要性质及归约算法的有效性,提出了一种基于与或图的Web服务自动组合方法。该方法针对Web服务请求的每一个输出对象实时构造与或图,再通过归约算法获取该输出对象的合成路径。与已有方法相比,该方法实现简单,搜索空间小,避免了重复搜索和循环搜索。仿真实验结果表明,该方法时间复杂度较好,能够在大规模的服务集中进行灵活、快速的服务组合。To compose services in a quick,flexible and effective way,after demonstrating the important properties of and/or graph and the validity of reduction algorithm,an approach based on and/or graph to compose services automatically is proposed.Aiming at web service’s each output object,this method creates a and/or graph immediately,and then fetches synthetic path through reduction algorithm.Compared with existing methods,it is simpler,has a smaller search space,and avoids repetition search and circulation search.Experiments illustrate that it has a good level of time complexity and a good effective performance even the repository has a large number of services.

关 键 词：与或图 WEB服务 服务组合 归约算法 面向服务的计算 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]