| dc.creator |
Hierons, RM |
|
| dc.date |
2006-11-06T11:25:20Z |
|
| dc.date |
2006-11-06T11:25:20Z |
|
| dc.date |
1998 |
|
| dc.date.accessioned |
2022-05-25T13:06:59Z |
|
| dc.date.available |
2022-05-25T13:06:59Z |
|
| dc.identifier |
The Computer Journal, 41(5): 349-355 |
|
| dc.identifier |
http://bura.brunel.ac.uk/handle/2438/348 |
|
| dc.identifier |
http://dx.doi.org/10.1093/comjnl/41.5.349 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/163679 |
|
| dc.description |
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. |
|
| dc.format |
373781 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en |
|
| dc.publisher |
Oxford University Press |
|
| dc.subject |
Finite automaton |
|
| dc.subject |
Abstract machine |
|
| dc.subject |
Deterministic automaton |
|
| dc.subject |
Non deterministic automaton |
|
| dc.subject |
Comparative study |
|
| dc.subject |
Algorithm |
|
| dc.subject |
Equivalence |
|
| dc.subject |
Implementation |
|
| dc.title |
Adaptive testing of a deterministic implementation against a nondeterministic finite state machine |
|
| dc.type |
Research Paper |
|
| dc.coverage |
17 |
|