The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
데이터 부분 사양에 부합하도록 프로토콜 구현을 위한 실행 가능하고 동기화 가능한(즉, e-동기화 가능한) 테스트 시퀀스를 생성하기 위한 새로운 기술이 제안되었습니다. 프로토콜의 제어 부분은 FSM(Finite State Machine)으로 지정되고, 데이터 부분은 규칙 집합으로 지정됩니다. 이 기술에는 FSM과 규칙을 DuplexSelect 이중 그래프로 변환하는 작업이 포함되며, 이를 통해 동기화 가능(즉, 동기화 문제가 발생하지 않음) 및 실행 가능(즉, 규칙을 위반하지 않는 매개변수 값과 연결됨) 테스트 시퀀스를 생성할 수 있습니다. 그런 다음 중국 우편 배달부 선택 알고리즘을 사용하여 각 규칙을 한 번 이상 확인하는 e-동기화 테스트 시퀀스의 비용을 최소화합니다.
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.
부
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
부
@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},}
부
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 -