E-Synchronizable Test Sequence for the Protocol Data Portion
Summary :
A new technique is proposed to generate the executable and synchronizable (i. e. , e-synchronizable) test sequence for the protocol implementation to be conformable to its data portion specification. The protocol's control portion is specified as a finite state machine (FSM), and its data portion is specified as a set of rules. The technique involves converting the FSM and the rules into the DuplexSelect digraph, from which we can generate test sequences which are both synchronizable (i. e. , encounter no synchronization problems) and executable (i. e. , associated with parameter values which do not violate the rules). The Selecting Chinese Postman Algorithm is then used for minimizing the cost of the e-synchronizable test sequence that verifies each rule at least once.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E83-B No.7 pp.1580-1583
- Publication Date
- 2000/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Wen-Huei CHEN, "E-Synchronizable Test Sequence for the Protocol Data Portion" in IEICE TRANSACTIONS on Communications,
vol. E83-B, no. 7, pp. 1580-1583, July 2000, doi: .
Abstract: A new technique is proposed to generate the executable and synchronizable (i. e. , e-synchronizable) test sequence for the protocol implementation to be conformable to its data portion specification. The protocol's control portion is specified as a finite state machine (FSM), and its data portion is specified as a set of rules. The technique involves converting the FSM and the rules into the DuplexSelect digraph, from which we can generate test sequences which are both synchronizable (i. e. , encounter no synchronization problems) and executable (i. e. , associated with parameter values which do not violate the rules). The Selecting Chinese Postman Algorithm is then used for minimizing the cost of the e-synchronizable test sequence that verifies each rule at least once.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e83-b_7_1580/_p
Copy
@ARTICLE{e83-b_7_1580,
author={Wen-Huei CHEN, },
journal={IEICE TRANSACTIONS on Communications},
title={E-Synchronizable Test Sequence for the Protocol Data Portion},
year={2000},
volume={E83-B},
number={7},
pages={1580-1583},
abstract={A new technique is proposed to generate the executable and synchronizable (i. e. , e-synchronizable) test sequence for the protocol implementation to be conformable to its data portion specification. The protocol's control portion is specified as a finite state machine (FSM), and its data portion is specified as a set of rules. The technique involves converting the FSM and the rules into the DuplexSelect digraph, from which we can generate test sequences which are both synchronizable (i. e. , encounter no synchronization problems) and executable (i. e. , associated with parameter values which do not violate the rules). The Selecting Chinese Postman Algorithm is then used for minimizing the cost of the e-synchronizable test sequence that verifies each rule at least once.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - E-Synchronizable Test Sequence for the Protocol Data Portion
T2 - IEICE TRANSACTIONS on Communications
SP - 1580
EP - 1583
AU - Wen-Huei CHEN
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E83-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2000
AB - A new technique is proposed to generate the executable and synchronizable (i. e. , e-synchronizable) test sequence for the protocol implementation to be conformable to its data portion specification. The protocol's control portion is specified as a finite state machine (FSM), and its data portion is specified as a set of rules. The technique involves converting the FSM and the rules into the DuplexSelect digraph, from which we can generate test sequences which are both synchronizable (i. e. , encounter no synchronization problems) and executable (i. e. , associated with parameter values which do not violate the rules). The Selecting Chinese Postman Algorithm is then used for minimizing the cost of the e-synchronizable test sequence that verifies each rule at least once.
ER -
English
