A method of verification of software based on CPN

As a formal technique of modelling, the Colored Petri Nets (CPN) is often used to model the parallel software systems with its outstanding advantages. The verification of software which has the parallel behaviors is too difficult. The state spaces of such systems are partial or occur the explosion easily because of limitation of computer memory and complexity of model. The truth is that the traditional methods of verification do not work with the partial or explosion of state space efficiently. In this paper, a novel method of verification of software systems based on the CPN is proposed. Firstly, the linear temporal logic (LTL) is used to describe the property of the system. And then verify the negation of property formula. Secondly, label the state in the path generated dynamically based on the different types of the LTL formulas. Finally, find the “good” path in the existing paths set to be the heuristic search according to the metrics: Complexity (Com), Number (Num), and Distance (Dis). At last, the CPN model is given to prove the validity and correctness of the algorithm.