Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/358| Title: | Reduced length checking sequences |
| Authors: | Hierons, RM Ural, H |
| Keywords: | Finite state machine;Checking sequence;Test minimization;Distinguishing sequence |
| Issue Date: | 2002 |
| Publisher: | Institute of Electrical and Electronics Engineers (IEEE) Computer Society |
| Citation: | Hierons. R.M. Ural. H. (2002) 'Reduced length checking sequences', IEEE Transactions on Computers, 51(9), pp. 1111-1117. doi:10.1109/tc.2002.1032630. |
| Abstract: | Here, the method proposed by Ural, Wu and Zhang (1997) for constructing minimal-length checking sequences based on distinguishing sequences is improved. The improvement is based on optimizations of the state recognition sequences and their use in constructing test segments. It is shown that the proposed improvement further reduces the length of checking sequences produced from minimal, completely specified, and deterministic finite state machines. |
| URI: | http://bura.brunel.ac.uk/handle/2438/358 |
| DOI: | https://doi.org/10.1109/tc.2002.1032630 |
| Appears in Collections: | Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FullText.pdf | 457.2 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.