Generation Of Concurrent Program Test-cases Based On Petri Nets

With the wide application of concurrent software,the testing is becoming the research object by many scholars. However, the uncertainty of the test path make it difficult in executing. Petri nets has incomparable advantage in describing concurrent with other system model. It provided the bridge for concurrent program and test path.At present, there are still some problems for generating the test paths base on Petri nets. The method base on reachability graph uses the hot priority and topological sort. It can remove the path which can not execute. But so many test paths. The method base on reachability tree can generate the test paths by finding circulation node:But it is more complicated. Therefore, studying the generation of concurrent program test paths based on Petri nets, is of great significance.By studying the technology of the related theory,based on the previous research results,we propose a test path generation method for concurrent programs based on petri nets. The main focuses of this paper are as follows:Firstly, by the tool of Petri nets--Platform Independent Petri Net Editor(PIPE) 3.0 to build its model and validate its property.Secondly,using the algorithm of reachability graph.and combined with UML state diagram,EFSM and Petri nets,the mothed can generate the class test paths by reachability graph and digraph search algorithms. We propose a algorithm to suitable the concurrent program and add the algorithm to PIPE 3.0. Experiment use segment method to reduce the size of the test paths and cover all the nodes in Petri nets.Finally,in this paper,we realize the generation in the following four steps:build Petri net, validate, transforms matrix about Petri net model, the generation of test paths. The experiment result shows that it is effective and feasible on the generation of test cases base on Petri nets.