| dc.creator |
Hierons, RM |
|
| dc.date |
2006-11-06T10:17:02Z |
|
| dc.date |
2006-11-06T10:17:02Z |
|
| dc.date |
1997 |
|
| dc.date.accessioned |
2022-05-25T13:06:58Z |
|
| dc.date.available |
2022-05-25T13:06:58Z |
|
| dc.identifier |
The Computer Journal 40(4): 220-230 |
|
| dc.identifier |
http://comjnl.oxfordjournals.org/cgi/content/abstract/40/4/220 |
|
| dc.identifier |
http://bura.brunel.ac.uk/handle/2438/347 |
|
| dc.identifier |
http://dx.doi.org/10.1093/comjnl/40.4.220 |
|
| dc.identifier.uri |
http://localhost:8080/xmlui/handle/CUHPOERS/163677 |
|
| dc.description |
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. |
|
| dc.format |
447345 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en |
|
| dc.publisher |
Oxford University Press |
|
| dc.subject |
Computer testing |
|
| dc.subject |
Finite state machine |
|
| dc.subject |
Transmission protocol |
|
| dc.title |
Testing from a finite state machine: Extending invertibility to sequences |
|
| dc.type |
Research Paper |
|
| dc.coverage |
24 |
|