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

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/347

Title: Testing from a finite state machine: Extending invertibility to sequences
Authors: Hierons, RM
Keywords: Computer testing
Finite state machine
Transmission protocol
Publication Date: 1997
Publisher: Oxford University Press
Citation: The Computer Journal 40(4): 220-230
Abstract: When testing a system modelled as a finite state machine it is desirable to minimize the effort required. It has been demonstrated that it is possible to utilize test sequence overlap in order to reduce the test effort and this overlap has been represented by using invertible transitions. In this paper invertibility will be extended to sequences in order to reduce the test effort further and encapsulate a more general type of test sequence overlap. It will also be shown that certain properties of invertible sequences can be used in the generation of state identification sequences.
URI: http://comjnl.oxfordjournals.org/cgi/content/abstract/40/4/220
http://bura.brunel.ac.uk/handle/2438/347
DOI: http://dx.doi.org/10.1093/comjnl/40.4.220
Appears in Collections:B-SERC Research Papers
Computer Science
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Testing from a finite.pdf436.86 kBAdobe PDFView/Open

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