Brunel University Research Archive (BURA) >
Research Areas >
Computer Science >

Please use this identifier to cite or link to this item:

Title: Testing from a nondeterministic finite state machine using adaptive state counting
Authors: Hierons, RM
Keywords: Software Engineering
Software/program verification
Testing and debugging
Nondeterministic finite state machine
Adaptive testing
State counting
Publication Date: 2004
Publisher: IEEE (Computer Society)
Citation: IEEE Transactions on Computers, 53(10): 1330-1342
Abstract: 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. This paper extends 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.
Appears in Collections:Computer Science
Software Engineering (B-SERC)
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Testing Non Deteministic.pdf319.4 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.