On minimizing the lengths of checking sequences

被引：82
|
作者：
Ural, H
Wu, XL
Zhang, F
机构：
[1] BELL NO RES LTD, OTTAWA, ON K1Y 4H7, CANADA
[2] CITY UNIV HONG KONG, DEPT COMP SCI, KOWLOON, HONG KONG
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1997年 / 46卷 / 01期
基金：
加拿大自然科学与工程研究理事会;
关键词：
finite state machines; fault detection; checking experiments; checking sequences; testing;
D O I：
10.1109/12.559807
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页码：93 / 99
页数：7
相关论文
共 50 条
12345