Abstract
A general model for constructing minimal length checking sequences employing a distinguishing sequence is proposed. The model is based on characteristics of checking sequences and a set of state recognition sequences. Some existing methods are shown to be special cases of the proposed model and are proven to construct checking sequences. The minimality of the resulting checking sequences is discussed and a heuristic algorithm for the construction of minimal length checking sequences is given. ©1997 IEEE.
| Original language | English |
|---|---|
| Pages (from-to) | 93-99 |
| Journal | IEEE Transactions on Computers |
| Volume | 46 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1997 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Funding
This work was supported in part by the Natural Sciences and Engineering Research Council of Canada and in part by the Telecommunications Research Institute of Ontario.
Research Keywords
- Checking experiments
- Checking sequences
- Fault detection
- Finite state machines
- Testing
Fingerprint
Dive into the research topics of 'On minimizing the lengths of checking sequences'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver