基于答案集的Web服务组合验证  

Answer Set Programming Based Verification of Semantic Web Service Composition

作　　者：钱俊彦[1,2] 黄国旺[2] 赵岭忠[2] 

机构地区：[1]国防科学技术大学并行与分布处理国家重点实验室,长沙410073 [2]桂林电子科技大学计算机科学与工程学院,桂林541004

出　　处：《计算机科学》2011年第12期131-134,161,共5页Computer Science

基　　金：国家自然科学基金(61063002;60803033);中国博士后基金(20090450211);广西自然科学基金(2011GXNSFA018164;2011GXNSFA018166);广西研究生创新基金(2009105950812M22);广西高等学校优秀人才资助计划等资助

摘　　要：语义Web服务组合的形式化描述和验证,是保证组合服务能正确运行的重要前提基础。首先描述基于答案集编程(Answer Set Programming)的OWL-S建模方法,并分析基于答案集编程建模的优势。然后给出OWL-S流程模型中几种控制结构到中间模型Petri网的映射,并提出由Petri网生成答案集编程的算法。同时将时态约束引入到组合服务验证中,利用时态约束表达待验证性质,将验证问题转换为求解逻辑程序的答案集。最后通过一个具体的实例说明该方法的有效性。Formal description and verification of semantic Web service composition are the premise of the correctness of running composite services. The paper described a method to modeling OWL-~G^eman Web service description lan- guage） based on answer set programming and analysed the advantages of this method, and the mapping of several kinds of basic control constructs in process model of OWL-S to Petri net which is the mid-mode was provided and an algo- rithm for generating the answer set programming was proposed. Meanwhile, introduced temporal constraints to the composite service verification to represent the property to be checked. Finally, a specific instance of the modeling and verification was applied into a case.

关 键 词：答案集编程 PETRI网 OWL-S 验证 

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