Optimal length test sequence generation using distinguishing sequences

Author

Ural, Hasan ; Zhu, Keqin

Author_Institution

Dept. of Comput. Sci., Ottawa Univ., Ont., Canada

Volume

1

Issue

3

fYear

1993

fDate

6/1/1993 12:00:00 AM

Firstpage

358

Lastpage

371

Abstract

The optimization of the length of test sequences for finite state machine based protocol conformance testing is studied. The study focuses on test generation methods, called D-methods, that utilize distinguishing sequences in the construction of test segments. The extent of the optimization of the length of a test sequence is investigated with respect to two cases. The first case establishes the lower bound for the length of test sequences generated by any D-method that overlaps test segments. The second case establishes the lower bound for the length of test sequences generated by any D-method that does not overlap test segments. It is observed that the reduction in the length of test sequences due to overlapping is significant. An efficient algorithm for the generation of test sequences is proposed. This algorithm utilizes a distinguishing sequence and overlaps test segments. Sufficiency conditions are given both for finding a minimum- length test sequence in polynomial time and for constructing the optimal length test sequences by this algorithm

Keywords

conformance testing; finite state machines; protocols; D-methods; algorithm; distinguishing sequences; finite state machine; lower bound; optimal length; polynomial time; protocol conformance testing; test segments; test sequence generation; Automata; Communication networks; Communication system control; Computer science; Councils; Fault detection; Operating systems; Polynomials; Protocols; Testing;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.234857

Filename

234857