Reduced length checking sequences

被引：62

作者：

Hierons, RM ^{[1
]}

Ural, H

机构：

[1] Brunel Univ, Dept Informat Syst & Comp, Uxbridge UB8 3PH, Middx, England

[2] Univ Ottawa, Sch Informat Technol & Engn, Ottawa, ON K1N 6N5, Canada

来源：

IEEE TRANSACTIONS ON COMPUTERS | 2002年 / 51卷 / 09期

基金：

加拿大自然科学与工程研究理事会;

关键词：

finite state machine; checking sequence; test minimization; distinguishing sequence;

D O I：

10.1109/TC.2002.1032630

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Here, the method proposed in [13] 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.

引用

页码：1111 / 1117

页数：7

共 14 条

[11] Test generation for multiple state-table faults in finite-state machines [J].

Pomeranz, I ;

Reddy, SM .

IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (07) :783-794

[12] FORMAL METHODS FOR PROTOCOL TESTING - A DETAILED STUDY [J].

SIDHU, DP ;

LEUNG, TK .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (04) :413-426

[13] On minimizing the lengths of checking sequences [J].

Ural, H ;

Wu, XL ;

Zhang, F .

IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (01) :93-99

[14] TESTING FINITE-STATE MACHINES - FAULT-DETECTION [J].

YANNAKAKIS, M ;

LEE, D .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 50 (02) :209-227

← 1 2 →