【摘要】：隨著Web服務(wù)技術(shù)的發(fā)展，服務(wù)的數(shù)量不斷增加，然而網(wǎng)絡(luò)上注冊(cè)的大部分Web服務(wù)都是功能單一、結(jié)構(gòu)簡(jiǎn)單的服務(wù)，當(dāng)面對(duì)用戶提出復(fù)雜的服務(wù)需求時(shí)，這些簡(jiǎn)單的服務(wù)便顯得無(wú)能為力。因此如何將網(wǎng)絡(luò)中獨(dú)立存在的Web服務(wù)在盡可能節(jié)省成本的前提下以最高的效率組合在一起具有重要意義。 本文以Petri網(wǎng)理論為基礎(chǔ)，針對(duì)Web服務(wù)自動(dòng)組合以及組合服務(wù)的形式化驗(yàn)證進(jìn)行了深入的研究，本文的主要工作如下：第一，在OWL-S語(yǔ)義Web服務(wù)描述的基礎(chǔ)上進(jìn)行了動(dòng)態(tài)QoS擴(kuò)展的研究，利用事例推理(CBR)方法對(duì)動(dòng)態(tài)QoS預(yù)測(cè)，使得服務(wù)描述具有動(dòng)態(tài)性，為服務(wù)查找、服務(wù)匹配和服務(wù)組合奠定了良好的基礎(chǔ)。第二，利用模糊推理Petri網(wǎng)(FRPN)方法對(duì)OWL-S描述的語(yǔ)義Web服務(wù)的原子進(jìn)程與復(fù)合進(jìn)程進(jìn)行形式化建模，然后借助服務(wù)匹配思想，分析了服務(wù)組合中可能出現(xiàn)的所有依賴(lài)關(guān)系，，建立了服務(wù)發(fā)布圖，采用基于模糊推理Petri網(wǎng)的推理方法，通過(guò)反向、正向推理算法從服務(wù)發(fā)布圖中提取出滿足用戶需求的Web服務(wù)組合序列。第三，采用Petri網(wǎng)的分析技術(shù)對(duì)推理得到的組合服務(wù)進(jìn)行形式化驗(yàn)證，首先利用轉(zhuǎn)移矩陣分析方法對(duì)組合模型進(jìn)行了可達(dá)性分析并檢測(cè)是否存在死鎖，然后采用可達(dá)樹(shù)分析方法驗(yàn)證Web服務(wù)組合的可靠性。 通過(guò)以上理論研究，本文對(duì)服務(wù)依賴(lài)關(guān)系圖生成算法和服務(wù)組合推理算法進(jìn)行仿真，驗(yàn)證了本文所設(shè)計(jì)的算法能夠很好的實(shí)現(xiàn)Web服務(wù)組合應(yīng)用，從而證明了本文模型的設(shè)計(jì)是合理的、算法的設(shè)計(jì)是有效的。
[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.
【學(xué)位授予單位】：沈陽(yáng)理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.09

【參考文獻(xiàn)】

相關(guān)期刊論文 前1條

1 鄧水光;吳健;李瑩;吳朝暉;;基于回溯樹(shù)的Web服務(wù)自動(dòng)組合[J];軟件學(xué)報(bào);2007年08期

相關(guān)博士學(xué)位論文 前1條

1 門(mén)鵬;基于Petri網(wǎng)的Web服務(wù)組合相關(guān)技術(shù)研究[D];西安電子科技大學(xué);2009年

本文編號(hào)：2295124