Concurrent N-Switch Coverage Criterion for Generating Test Cases from Place/Transition Nets

A PN (place/transition net) is known as an algebraic model that is useful for describing concurrent, distributed and asynchronous properties of software, and it is also recognized as a model of MBT (model-based testing) that is an important technique for developing high quality software. We propose a concurrent N-switch coverage criterion to generate test cases of high coverage levels from a PN representing test specifications of software. All sequences of successive fireable transitions of length N+1 on the PN can be covered by executing test cases that satisfy the concurrent N-switch coverage criterion. This paper shows its processes, work products, algorithms, and examples.