© 1998 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
Department of Mathematical and Computing Sciences, Goldsmiths College, University of London, London SE14 6NW Email: r.hierons{at}gold.ac.uk
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.
Received September 25, 1997. revised June 30, 1998.