基于可达图的Web服务组合验证  

WEB SERVICE COMPOSITION VERIFICATION BASED ON REACHABILITY GRAPH

作　　者：乔彬[1] 吴国文[1] 葛孝堃 

机构地区：[1]东华大学计算机科学与技术学院,上海201620 [2]上海市软中信息技术有限公司,上海200235

出　　处：《计算机应用与软件》2009年第9期203-205,共3页Computer Applications and Software

摘　　要：针对基于Petri网的Web服务组合形式化建模,给出了Web服务网的正确性定义和可达图的构造算法。采用可达图作为分析工具,对Web服务网的可达性、有界性、安全性和活性等特性进行分析,给出验证Web服务组合正确性的方法,并举例说明了这种方法的应用。The correctness definition and reachability graph construction algorithm of Web service net are proposed for the formal modelling of Web services composition based on Petri-net. The reachability graph analysis technique is adopted to analyze the specialties of Web services net such as reachability, boundness, safeness and liveness. Thus, an approach is proposed to verify the correctness of Web service composition model. Finally, an example is raised for describing the application of this approach.

关 键 词：WEB服务组合 验证 PETRI网 可达图 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] TP301[自动化与计算机技术—计算机科学与技术]