An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours

Author

Aho, Alfred V. ; Dahbura, Anton T. ; Lee, David ; Uyar, M. Umit

Author_Institution

Bellcore Labs., Morristown, NJ, USA

Volume

39

Issue

11

fYear

1991

fDate

11/1/1991 12:00:00 AM

Firstpage

1604

Lastpage

1615

Abstract

A method for generating test sequences for checking the conformance of a protocol implementation to its specification is described. A rural Chinese postman tour problem algorithm is used to determine a minimum-cost tour of the transition graph of a finite-state machine. It is shown that, when the unique input/output sequence (UIO) is used in place of the more cumbersome distinguishing sequence, both the controllability and observability problems of the protocol testing problem are addressed, providing an efficient method for computing a test sequence for protocol conformance testing

Keywords

computational complexity; conformance testing; directed graphs; finite automata; optimisation; protocols; ISDN interface; computational complexity; controllability; directed graphs; finite automata; finite-state machine; minimum-cost tour; observability; optimization; protocol conformance test generation; rural Chinese postman tour problem; transition graph; unique input/output sequence; Automata; Automatic testing; Communications Society; Controllability; Laboratories; Observability; Protocols; System testing;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.111442

Filename

111442