Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/348
Title: Adaptive testing of a deterministic implementation against a nondeterministic finite state machine
Authors: Hierons, RM
Keywords: Finite automaton;Abstract machine;Deterministic automaton;Non deterministic automaton;Comparative study;Algorithm;Equivalence;Implementation
Issue Date: 1998
Publisher: Oxford University Press
Citation: The Computer Journal, 41(5): 349-355
Abstract: A number of authors have looked at the problem of deriving a checking experiment from a nondeterministic finite state machine that models the required behaviour of a system. We show that these methods can be extended if it is known that the implementation is equivalent to some (unknown) deterministic finite state machine. When testing a deterministic implementation, the test output provides information about the implementation under test and can thus guide future testing. The use of an adaptive test process is thus proposed.
URI: http://bura.brunel.ac.uk/handle/2438/348
DOI: http://dx.doi.org/10.1093/comjnl/41.5.349
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Adaptive Testing.pdf365.02 kBAdobe PDFView/Open


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