AN OPTIMIZATION TECHNIQUE FOR PROTOCOL CONFORMANCE TEST-GENERATION BASED ON UIO SEQUENCES AND RURAL CHINESE POSTMAN TOURS

被引：141

作者：

AHO, AV

DAHBURA, AT

LEE, D

UYAR, MU

机构：

[1] MOTOROLA INC, CAMBRIDGE RES CTR, CAMBRIDGE, MA 02139 USA

[2] AT&T BELL LABS, HOLMDEL, NJ 07733 USA

[3] AT&T BELL LABS, COMP SCI RES CTR, TECH STAFF, MURRAY HILL, NJ 07974 USA

[4] AT&T BELL LABS, COMP SYST RES LAB, DISTRIBUTED SYST RES DEPT, MURRAY HILL, NJ 07974 USA

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1991年 / 39卷 / 11期

关键词：

D O I：

10.1109/26.111442

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper describes a method for generating test sequences for checking the conformance of a protocol implementation to its specification. A rural Chinese postman tour is used to determine a minimum-cost tour of the transition graph of a finite-state machine. When used in combination with unique input/output sequences [20], [21], the technique yields an efficient method for computing a test sequence for protocol conformance testing.

引用

页码：1604 / 1615

页数：12

共 30 条

[1]

Aho Alfred V., 1974, DESIGN ANAL COMPUTER

[2]

AHO AV, 1988, PROTOCOL SPECIFICATI, V8, P75

[3]

AHO AV, UNPUB EFFICIENT ALGO

[4]

BONDY JA, 1976, GRAPH THEORY APPLICA

[5]

DAHBURA AT, 1988, P IEEE INFOCOM, P71

[6]

Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113

[7] THEORETICAL IMPROVEMENTS IN ALGORITHMIC EFFICIENCY FOR NETWORK FLOW PROBLEMS [J].

EDMONDS, J ;

KARP, RM .

JOURNAL OF THE ACM, 1972, 19 (02) :248-&

[8]

Fredman M. L., 1984, 25th Annual Symposium on Foundations of Computer Science (Cat. No. 84CH2085-9), P338, DOI 10.1109/SFCS.1984.715934

[9]

Friedman A.D., 1971, FAULT DETECTION DIGI

[10]

Gibbons A., 1985, ALGORITHMIC GRAPH TH

← 1 2 3 →