Testing from a nondeterministic finite state machine using adaptive state counting

• Published in: IEEE transactions on computers Vol. 53; no. 10; pp. 1330 - 1342
• Main Author: Hierons, R.M.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-10-2004; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: adaptive testing; Finite state machines; Index Terms- Software engineering; nondeterministic finite state machine; Software debugging; Software requirements and specifications; Software verification and validation; software/program verification; state counting; testing and debugging
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/TC.2004.85

The problem of generating a checking experiment from a nondeterministic finite state machine has been represented in terms of state counting. However, test techniques that use state counting traditionally produce preset test suites. We extend the notion of state counting in order to allow the input/output sequences observed in testing to be utilized: Adaptive state counting is introduced. The main benefit of the proposed approach is that it may result in a reduction in the size of the test suite used. An additional benefit is that, where a failure is observed, it is possible to terminate test generation at this point.