本文選題：并行軟件　切入點(diǎn)：著色Petri網(wǎng)　出處：《內(nèi)蒙古大學(xué)》2017年碩士論文　論文類型：學(xué)位論文

【摘要】：隨著軟件產(chǎn)業(yè)的飛速發(fā)展,并行軟件系統(tǒng)己經(jīng)成為當(dāng)下主流的一種軟件系統(tǒng),在人們生活生產(chǎn)中扮演越來越重要的角色。例如常見的云計(jì)算軟件、網(wǎng)絡(luò)軟件等軟件系統(tǒng)都具有并行行為的特點(diǎn)。而作為保證軟件質(zhì)量的關(guān)鍵環(huán)節(jié),軟件測試則起著關(guān)鍵作用。然而,并行軟件由于其并行特點(diǎn)容易導(dǎo)致狀態(tài)空間爆炸,傳統(tǒng)測試方法大多針對狀態(tài)空間完成測試序列生成,狀態(tài)爆炸時(shí)無法進(jìn)行高效的軟件測試,通常存在著低覆蓋率、高冗余率、低測試效率等問題。通過模型化簡縮減狀態(tài)空間的方法可以有效降低并行軟件測試的復(fù)雜度,保證化簡后模型測試效果不變是化簡方法研究中的關(guān)鍵問題。目前針對軟件測試的模型化簡方法主要是基于跡等價(jià)的化簡,此類方法并不能夠降低并發(fā)執(zhí)行的復(fù)雜度,所以化簡效果有限。本文圍繞待測行為及其相關(guān)行為進(jìn)行并行軟件模型化簡,針對與待測行為無關(guān)的分支進(jìn)行串行化處理以及限制處理,從而實(shí)現(xiàn)縮減狀態(tài)空間的目的,使得化簡前后關(guān)于待測行為的測試效果不變。本文關(guān)于化簡方法做了以下幾個方面的工作:(1)針對復(fù)雜并行軟件模型,引入待測行為及相關(guān)行為等概念,以待測行為來描述本次測試的目的,以相關(guān)行為來描述與本次測試數(shù)據(jù)流相關(guān)的行為。在模型的化簡過程中,本方法僅僅對與本次測試無關(guān)的非待測行為進(jìn)行化簡,因此不僅保證了本方法的正確性,而且縮減了狀態(tài)空間規(guī)模,從而提升了測試的效率。(2)本文提出了同源分支的概念,將同源分支劃分為并發(fā)分支組或選擇分支集,在并發(fā)分支組或選擇分支集內(nèi)部進(jìn)行化簡操作。由于一個并發(fā)分支組或選擇分支集中的全部分支都來自于同一源節(jié)點(diǎn),同源性保證了無關(guān)分支串行化處理和限制處理對于待測相關(guān)行為的測試不受影響。(3)在一個并發(fā)分支組或選擇分支集內(nèi)部,依據(jù)支路存在待測行為和相關(guān)行為的情況,采用添加抑制弧的方式,完成待測行為無關(guān)分支的串行化操作和限制處理。通過抑制弧的方式?jīng)]有修改任何模型元素,只是限制了并發(fā)順序及部分無關(guān)分支限制處理,保證了化簡后模型的正確性。并發(fā)分支的串行化和選擇分支的限制處理可以大幅縮減狀態(tài)空間,被串行化和限制處理的分支不含有待測行為或相關(guān)行為,所以對本次待測行為的測試效果不變。最后,文章對化簡算法的正確性進(jìn)行了證明,并通過應(yīng)用實(shí)例分析,驗(yàn)證了本方法的正確性以及對待測軟件模型狀態(tài)空間的縮減效果。
[Abstract]:With the rapid development of software industry, parallel software system has become a mainstream software system, playing a more and more important role in people's daily production, such as common cloud computing software, Network software and other software systems all have the characteristics of parallel behavior. As a key link to guarantee software quality, software testing plays a key role. However, parallel software can easily lead to state space explosion because of its parallelism. Most of the traditional test methods are based on the state space to complete the test sequence generation, state explosion can not carry out efficient software testing, usually there is a low coverage rate, high redundancy rate. The complexity of parallel software testing can be effectively reduced by reducing the state space by model simplification. It is a key problem in the research of simplification method to ensure that the effect of model test is unchanged after simplification. At present, the modeling simplification method for software testing is mainly based on trace equivalence reduction, and this kind of method can not reduce the complexity of concurrent execution. Therefore, the effect of simplification is limited. In this paper, parallel software modeling is carried out around the behavior to be tested and related behaviors, and serialization and restriction processing are carried out for the branches independent of the behavior to be tested, so as to achieve the purpose of reducing the state space. In this paper, we do the following work on the simplification method: 1) for the complex parallel software model, we introduce the concepts of the behavior to be tested and the related behavior. The purpose of the test is described by the behavior to be tested, and the behavior related to the data flow is described by the related behavior. In the process of simplification of the model, the method only simplifies the untested behavior which is independent of this test. Therefore, not only the correctness of this method is guaranteed, but also the scale of state space is reduced, thus the efficiency of testing is improved. In this paper, the concept of homology branch is proposed, which is divided into concurrent branch group or select branch set. Simplify within a concurrent branch group or select branch set. Because all the branches of a concurrent branch group or selected branch set come from the same source node, Homology ensures that independent branching serialization and restriction processing are not affected for testing related behaviors to be tested) within a concurrent branch group or selected branch set, depending on the existence of untested behavior and related behavior in the branch. By adding suppression arcs, the serialization operation and restriction processing of the non-branching of the behavior to be tested is completed. No model elements are modified by the suppression arc, but the concurrency order and the partially independent branch restriction processing are restricted. The serialization of concurrent branches and the limited processing of selecting branches can greatly reduce the state space, and the branches of serialization and restriction processing do not contain untested or related behaviors. Finally, the correctness of the simplification algorithm is proved, and the validity of the method and the reduction effect of the test software model state space are verified by an application example.
【學(xué)位授予單位】：內(nèi)蒙古大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP311.53

【參考文獻(xiàn)】

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

1 陸陽;岳峰;張國富;蘇兆品;王永奇;;串并行軟件系統(tǒng)測試資源動態(tài)分配建模及求解[J];軟件學(xué)報(bào);2016年08期

2 孫雪姣;劉驚雷;;CP-nets的可滿足性序列求解算法研究[J];計(jì)算機(jī)科學(xué);2015年05期

3 劉曉強(qiáng);解筱夢;杜明;常姍;蔡立志;劉振宇;;面向云測試的并行測試用例自動生成方法[J];計(jì)算機(jī)應(yīng)用;2015年04期

4 孫濤;葉新銘;;針對軟件中2路并發(fā)行為完全覆蓋的測試方法[J];重慶郵電大學(xué)學(xué)報(bào)(自然科學(xué)版);2014年06期

5 葛云生;湯泓;樂曉波;潘小海;;時(shí)間Petri網(wǎng)與CAGA算法相結(jié)合的并行測試研究[J];計(jì)算機(jī)應(yīng)用與軟件;2014年11期

6 董路路;李華;張素梅;;Web應(yīng)用工作流的CPN建模及測試序列生成[J];內(nèi)蒙古大學(xué)學(xué)報(bào)(自然科學(xué)版);2013年05期

7 張愛玲;徐智;宗巖;康健;;基于CPN的切換模式下行車許可生成過程研究[J];計(jì)算機(jī)技術(shù)與發(fā)展;2012年04期

8 李鶴;唐達(dá);;一種工作流管理系統(tǒng)的模型化簡方法[J];湖北汽車工業(yè)學(xué)院學(xué)報(bào);2009年01期

9 周飛;楊根興;蔡立志;;基于UML的測試用例生成方法研究[J];計(jì)算機(jī)應(yīng)用與軟件;2009年02期

10 鄺宏斌;羅貴明;;并行軟件模型檢測[J];計(jì)算機(jī)工程;2008年19期

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

1 張亞萍;基于云計(jì)算的軟件測試關(guān)鍵技術(shù)研究[D];南京郵電大學(xué);2016年

2 劉璐;基于CP-nets的針對待測線性行為的測試序列生成工具的設(shè)計(jì)與實(shí)現(xiàn)[D];內(nèi)蒙古大學(xué);2016年

3 劉文龍;一種CP-nets的模型跡等價(jià)化簡工具的設(shè)計(jì)與實(shí)現(xiàn)[D];內(nèi)蒙古大學(xué);2016年

4 丁森科;基于Petri Net軟件測試系統(tǒng)的研究[D];浙江大學(xué);2016年

5 劉偉;基于云計(jì)算的軟件并行測試關(guān)鍵技術(shù)的研究[D];東華大學(xué);2013年

6 霍敏霞;基于Petri網(wǎng)的并發(fā)程序測試路徑生成[D];西南大學(xué);2011年

，

本文編號：1590934