【摘要】：隨著Web服務技術的發(fā)展，服務的數量不斷增加，然而網絡上注冊的大部分Web服務都是功能單一、結構簡單的服務，當面對用戶提出復雜的服務需求時，這些簡單的服務便顯得無能為力。因此如何將網絡中獨立存在的Web服務在盡可能節(jié)省成本的前提下以最高的效率組合在一起具有重要意義。 本文以Petri網理論為基礎，針對Web服務自動組合以及組合服務的形式化驗證進行了深入的研究，本文的主要工作如下：第一，在OWL-S語義Web服務描述的基礎上進行了動態(tài)QoS擴展的研究，利用事例推理(CBR)方法對動態(tài)QoS預測，使得服務描述具有動態(tài)性，為服務查找、服務匹配和服務組合奠定了良好的基礎。第二，利用模糊推理Petri網(FRPN)方法對OWL-S描述的語義Web服務的原子進程與復合進程進行形式化建模，然后借助服務匹配思想，分析了服務組合中可能出現的所有依賴關系，，建立了服務發(fā)布圖，采用基于模糊推理Petri網的推理方法，通過反向、正向推理算法從服務發(fā)布圖中提取出滿足用戶需求的Web服務組合序列。第三，采用Petri網的分析技術對推理得到的組合服務進行形式化驗證，首先利用轉移矩陣分析方法對組合模型進行了可達性分析并檢測是否存在死鎖，然后采用可達樹分析方法驗證Web服務組合的可靠性。 通過以上理論研究，本文對服務依賴關系圖生成算法和服務組合推理算法進行仿真，驗證了本文所設計的算法能夠很好的實現Web服務組合應用，從而證明了本文模型的設計是合理的、算法的設計是有效的。
[Abstract]:With the development of Web services technology, the number of Web services is increasing. However, most of the Web services registered on the network are simple services with simple structure. These simple services seem powerless. Therefore, it is of great significance to combine the independent Web services in the network with the highest efficiency on the premise of saving the cost as much as possible. Based on the theory of Petri nets, this paper makes a deep research on the automatic composition of Web services and the formal verification of composite services. The main work of this paper is as follows: first, Based on the OWL-S semantic Web service description, the dynamic QoS extension is studied, and the dynamic QoS prediction is made by using the Case-based (CBR) method, which makes the service description dynamic, which is the service lookup. Service matching and service composition lay a good foundation. Secondly, the atomic process and composite process of semantic Web services described by OWL-S are modeled by using fuzzy reasoning Petri net (FRPN) method, and then all possible dependencies in service composition are analyzed by the idea of service matching. The service publishing graph is established, and the inference method based on fuzzy reasoning Petri net is adopted. By reverse and forward reasoning algorithm, the Web service composition sequence that meets the needs of the user is extracted from the service publishing graph. Thirdly, the Petri net analysis technique is used to formally verify the composition services. Firstly, the reachability of the composition model is analyzed by using the transfer matrix analysis method and the deadlock is detected. Then the reliability of Web service composition is verified by reachability tree analysis method. Through the above theoretical research, this paper simulates the service dependency graph generation algorithm and the service composition reasoning algorithm, and verifies that the algorithm designed in this paper can implement the Web service composition application well. It is proved that the design of the model is reasonable and the algorithm is effective.
【學位授予單位】：沈陽理工大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TP393.09

【參考文獻】

相關期刊論文 前1條

1 鄧水光;吳健;李瑩;吳朝暉;;基于回溯樹的Web服務自動組合[J];軟件學報;2007年08期

相關博士學位論文 前1條

1 門鵬;基于Petri網的Web服務組合相關技術研究[D];西安電子科技大學;2009年

本文編號：2295124