| 基于可达图的Web服务组合验证 |
| |
| 引用本文： | 乔彬,吴国文,葛孝堃. 基于可达图的Web服务组合验证[J]. 计算机应用与软件, 2009, 26(9): 203-205 |
| |
| 作者姓名： | 乔彬 吴国文 葛孝堃 |
| |
| 作者单位： | 1. 东华大学计算机科学与技术学院,上海,201620
2. 上海市软中信息技术有限公司,上海,200235 |
| |
| 摘 要： | 针对基于Petri网的Web服务组合形式化建模,给出了Web服务网的正确性定义和可达图的构造算法.采用可达图作为分析工具,对Web服务网的可达性、有界性、安全性和活性等特性进行分析,给出验证Web服务组合正确性的方法,并举例说明了这种方法的应用.
|
| 关 键 词： | Web服务组合 验证 Petri网 可达图 |
WEB SERVICE COMPOSITION VERIFICATION BASED ON REACHABILITY GRAPH |
| |
| Qiao Bin,Wu Guowen,Ge Xiaokun. WEB SERVICE COMPOSITION VERIFICATION BASED ON REACHABILITY GRAPH[J]. Computer Applications and Software, 2009, 26(9): 203-205 |
| |
| Authors: | Qiao Bin Wu Guowen Ge Xiaokun |
| |
| Affiliation: | School of Computer Science and Technology;Donghua Universiey;Shanghai 201620;China;Shanghai Ruanzhong Information Technology Co.;LTD;Shanghai 200235;China |
| |
| Abstract: | 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. |
| |
| Keywords: | Web service composition Verification Petri-net Reachability graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
