An efficient algorithm of simplest lts using strong equivalence for white box approach

Abstract

In a large system, it is the most important work to consider the verification of the overall source codes and also to test minimal test cases for the maximal test coverage. In the current testing situations, if a complicated and huge system is developed, it may be difficult to test all the source codes. How could it extract small-sized test cases and satisfy high coverage if possible? For this, our previous research worked a simplest LTS using two steps of the transformation algorithm. Bur this paper suggests an efficient algorithm to transform original LTS into Simplest LTS at one time to extract minimal test cases for the maximal test coverage. It can expect an advantage to decrease computer sources and testing time epochally because it tests errors after excluding the recursion of software source codes with Strong Equivalence and optimizing them. © 2014 SERSC.