Finite state machines being intuitively understandable and suitable for modeling in many domains, they are adopted by many software designers. Therefore, testing systems that are modeled with state machines has received genuine attention. Among the studied testing strategies are complete round-trip paths and transition trees that cover round-trip paths in a piece wise manner. We present an empirical study that aims at comparing the effectiveness of the complete round-trip paths test suites to the transition trees test suites in one hand, and comparing the effectiveness of the different techniques used to generate transition trees (breadth first traversal, depth first traversal, and random traversal) on the other hand. We also compare the effectiveness of all the testing trees generated using each single traversal criterion. This is done through conducting an empirical evaluation using four case studies from different domains. Effectiveness is evaluated with mutants. Experimental results are presented and analyzed.

Additional Metadata
Keywords Finite state machines, Round-trip paths, Transition paths coverage., Transition trees
Persistent URL dx.doi.org/10.1109/ISSRE.2017.34
Conference 28th IEEE International Symposium on Software Reliability Engineering, ISSRE 2017
Citation
Khalil, H. (Hoda), & Labiche, Y. (2017). On FSM-Based Testing: An Empirical Study: Complete Round-Trip Versus Transition Trees. In Proceedings - International Symposium on Software Reliability Engineering, ISSRE (pp. 305–315). doi:10.1109/ISSRE.2017.34