A two phase approach for checking sequence generation

Abstract

A new method for constructing a checking sequence for finite state machine (FSM) based testing is introduced. It is based on a recently suggested method which uses quite a different approach than almost all the methods developed since the introduction of the checking sequence generation problem around half a century ago. Unlike its predecessor which aggressively tries to recognize the states by applying identification sequences, our approach relies on yet to be generated parts of the sequence for this. The method may terminate without producing a checking sequence. We also suggest a method to check if a sequence is a checking sequence for this purpose. If it turns out not be a checking a sequence, a post processing phase extends the sequence further. We present the results of an experimental study showing that our two phase approach produces shorter checking sequences than the previously published methods. This experimental study is performed on FSMs that are randomly generated by using a tool implemented within this work to support this and other FSM based testing studies.