Abstract

Modeling and testing for parallel software systems are very difficult, because the number of states and execution sequences expands significantly caused by parallel behaviors. In this paper, a model reduction method based on Coloured Petri Net (CPN) is shown, which could generate a functionality-equivalent and trace-equivalent model with smaller scale. Model-based testing for parallel software systems becomes much easier after the model is reduced by the reduction method. Specifically, a formal model for software system specification is constructed based on CPN. Then the places in the model are divided into input places, output places, and internal places; the transitions in the model are divided into input transitions, output transitions, and internal transitions. Internal places and internal transitions could be reduced if preconditions are matching, and some other operations should be done for functionality equivalence and trace equivalence. If the place and the transition are in a parallel structure, then many execution sequences will be removed from the state space. We have proved the equivalence and have analyzed the reduction effort, so that we could get the same testing result with much lower testing workload. Finally, some practices and a performance analysis show that the method is effective.

Highlights

  • Many software applications are parallel software systems

  • The method is effective for all kinds of Coloured Petri Net (CPN) models, including sequence structure, fork and joint structure, and parallel and synchronization structure

  • A CPN model reduction method based on trace-equivalence principle is shown and applied on system model M

Read more

Summary

Introduction

Many formal languages, like CPN and Input Output Symbolic Transition System (IOSTS), could model parallel software; testing methods based on these languages could not work well because the number of states in the model is too large. If the place and the transition being removed are in a parallel synchronization structure, many execution sequences will be removed from the state space, so that we could get the same testing result with much lower testing workload. The major contribution of this paper is to propose a CPN model-based reduction method for parallel software testing, which could reduce the model automatically. The method is effective for all kinds of CPN models, including sequence structure, fork and joint structure, and parallel and synchronization structure.

Related Work
Preliminaries
Model Reduction Method
TC c 3
Practical Applications of the Algorithm
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call