Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/347
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHierons, RM-
dc.coverage.spatial24en
dc.date.accessioned2006-11-06T10:17:02Z-
dc.date.available2006-11-06T10:17:02Z-
dc.date.issued1997-
dc.identifier.citationThe Computer Journal 40(4): 220-230en
dc.identifier.urihttp://comjnl.oxfordjournals.org/cgi/content/abstract/40/4/220en
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/347-
dc.description.abstractWhen 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.en
dc.format.extent447345 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherOxford University Pressen
dc.subjectComputer testingen
dc.subjectFinite state machineen
dc.subjectTransmission protocolen
dc.titleTesting from a finite state machine: Extending invertibility to sequencesen
dc.typeResearch Paperen
dc.identifier.doihttp://dx.doi.org/10.1093/comjnl/40.4.220-
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

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.