An Optimized Test Sequence Generation Method for Communication Systems--Improved SW Method--

Fumiaki SATO; Tadanori MIZUNO

An Optimized Test Sequence Generation Method for Communication Systems--Improved SW Method--

Fumiaki SATO, Tadanori MIZUNO

Full Text Views

0

Share
Cite this

Summary :

This paper describes a reduction algorithm for SW method which generates test sequences for communication systems. SW method is based upon the Finite State Machine (FSM). SW method uses a set of characterizing sequences and a state transition checking approach. This paper concentrates the characteristics of the SW sequences, and proposes the new derivation algorithm of characterizing sequences. Furthermore, Chinese Postman Tour and Extended Chinese Postman Tour is proposed to reduce redundancy of the SW sequences. This paper also presents an evaluation of this method in terms of an upper bound of the sequence length and generated test sequence length. The evaluation shows that the algorithm dramatically reduces the sequence length of the original method.

Publication: IEICE TRANSACTIONS on Communications Vol.E75-B No.10 pp.1024-1031

Publication Date: 1992/10/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Communication Software Technologies)

Category

Cite this

Copy

Fumiaki SATO, Tadanori MIZUNO, "An Optimized Test Sequence Generation Method for Communication Systems--Improved SW Method--" in IEICE TRANSACTIONS on Communications, vol. E75-B, no. 10, pp. 1024-1031, October 1992, doi: .
Abstract: This paper describes a reduction algorithm for SW method which generates test sequences for communication systems. SW method is based upon the Finite State Machine (FSM). SW method uses a set of characterizing sequences and a state transition checking approach. This paper concentrates the characteristics of the SW sequences, and proposes the new derivation algorithm of characterizing sequences. Furthermore, Chinese Postman Tour and Extended Chinese Postman Tour is proposed to reduce redundancy of the SW sequences. This paper also presents an evaluation of this method in terms of an upper bound of the sequence length and generated test sequence length. The evaluation shows that the algorithm dramatically reduces the sequence length of the original method.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e75-b_10_1024/_p

Copy

@ARTICLE{e75-b_10_1024,
author={Fumiaki SATO, Tadanori MIZUNO, },
journal={IEICE TRANSACTIONS on Communications},
title={An Optimized Test Sequence Generation Method for Communication Systems--Improved SW Method--},
year={1992},
volume={E75-B},
number={10},
pages={1024-1031},
abstract={This paper describes a reduction algorithm for SW method which generates test sequences for communication systems. SW method is based upon the Finite State Machine (FSM). SW method uses a set of characterizing sequences and a state transition checking approach. This paper concentrates the characteristics of the SW sequences, and proposes the new derivation algorithm of characterizing sequences. Furthermore, Chinese Postman Tour and Extended Chinese Postman Tour is proposed to reduce redundancy of the SW sequences. This paper also presents an evaluation of this method in terms of an upper bound of the sequence length and generated test sequence length. The evaluation shows that the algorithm dramatically reduces the sequence length of the original method.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - An Optimized Test Sequence Generation Method for Communication Systems--Improved SW Method--
T2 - IEICE TRANSACTIONS on Communications
SP - 1024
EP - 1031
AU - Fumiaki SATO
AU - Tadanori MIZUNO
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E75-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 1992
AB - This paper describes a reduction algorithm for SW method which generates test sequences for communication systems. SW method is based upon the Finite State Machine (FSM). SW method uses a set of characterizing sequences and a state transition checking approach. This paper concentrates the characteristics of the SW sequences, and proposes the new derivation algorithm of characterizing sequences. Furthermore, Chinese Postman Tour and Extended Chinese Postman Tour is proposed to reduce redundancy of the SW sequences. This paper also presents an evaluation of this method in terms of an upper bound of the sequence length and generated test sequence length. The evaluation shows that the algorithm dramatically reduces the sequence length of the original method.
ER -