• Journal of Korea Multimedia Society
• /
• v.1 no.1
• /
• pp.109-119
• /
• 1998

This paper describes a research result on automatic generation of Abstract Test Suite from INAP protocol in formal specifications by applying many existing related algorithms such as Rural Chinese Postman Tour and UIO sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence concepts. We use the I/O FSM generated from SDL specifications and a characterizing sequence, called UIO sequence, is defined for the I/O FSM. The UIO sequence is combined with the concept of Rural Chinese Postman tour to obtain an optimal test sequence. It also proposes an estimation methodology of the fault courage for the Test Suite obtained by our method and their translation into the standardized test notation TTCN.

• IE interfaces
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2004

This paper considers a conformity testing problem on EJB(Enterprise JavaBeans). The EJB architecture is a component architecture for the development and deployment of component-based distributed business applications. The objective is to find an optimal test sequence for the conformity test between the EJB specification and an implemented one. For the test sequence, we formulate the problem as a rural Chinese postman tour one and use a linear programming formulation. Based upon the formulations, we suggest a conformance test procedure and show its efficiency by applying the procedure to the CMP(Container- Managed persistency) entity bean of the EJB.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1821-1841
• /
• 1997

This paper presents an automated protocol conformance test sequence generation based on formal methods for LOTOS specification by using and applying many existing related algorithms and technique, such as the testing framework, Rural Chinese Postman tour concepts. We use the state-transition graphs obtained from LOTOS specifications by means of the CAESAR tool. This tool compiles a specification written in LOTOS into an extended Petri net, from which a transition graph of a event finite-state machine(EvFSM) including data is generated. A new characterizing sequence(CS), called Unique Event sequence(UE sequence) is defined. An UE sequence for a state is a sequence of accepted gate events that is unique for this state. Some experiences about UE sequence, partial UE sequence and signature are also explained. These sequences are combined with the concept of the Rural Chinese Postman Tour to obtain an optimal test sequence which is a minimum cost tour of the reference transition graph of the EvFSM. This paper also presents a fault coverage estimation experience of an automated method for optimized test sequences generation and the translation of the test sequence obtained by using our tool to TTCN notation are also given. A prototype of the proposed framework has been built with special attention to real application in order to generated the executable test cases in an automatic way. This formal method on conformance testing can be applied to the protocols related to IN, PCS and ATM for the purpose of verifying the correctness of implementation with respect to the given specification.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.241-249
• /
• 1997

In this paper, a new technique is proposed for generating a minimum-length synchronizable test sequence that can be applied in the distributed test architecture where both external synchtonization and input/output operation costs are taken into consideration. the method defines a set of transformation rules that constructs a duplex digraph from a given finite state machine representation of a protocol specification rules that constructs a duplex digraph from a given finite state machine representation of a protocol specificatio such that a rural chinese postman tour of the duplex digraph can be used to generate a minimum-length synchronizable test sequence using synchronizable distinguishing sequences as the state identification sequence for each state of the given finite state machine. The method provides an elegant solution to the synchronization problem that arises during the application of a predetermined test sequence in some protocol test architectures that utilize remote testers.

• Electronics and Telecommunications Trends
• /
• v.14 no.2 s.56
• /
• pp.26-37
• /
• 1999

ATM 프로토콜 적합성 시험 생성 도구 개발을 프로토콜 개발 통합환경과 연계하여 개발한다. 즉 생성된 I/O FSM 중간모델을 대상으로 연구된 가장 짧은 길이의 시험 스위트(test suite)를 생성하는 알고리즘을 편리하고 용이하게 적용하기 위해 데이터 구조화 및 컴퓨터 내에서의 표현 등을 위한 초기화 작업기능을 SDL Editor & Simulator를 활용하여 확인한다. 그리고 ATS(Abstract Test Suite) 생성은 UIO 시퀀스를 결정하고, TUT와 도착상태의 UIO 시퀀스를 결합한 시험 subsequence 생성과 symmetric argumentation 과정을 거처 RCP(Rural Chinese Postman) Tour 생성 알고리즘 구현을 통해 완전 시험 스위트 생성도구를 개발하고, 프로토콜 검정기와 연계하여 통합된 환경에서 사용할 수 있도록 개발한다.

• ETRI Journal
• /
• v.19 no.4
• /
• pp.363-388
• /
• 1997

This paper describes a research result on automatic generation of abstract test cases from formal specifications by applying many related algorithms and techniques such as the testing framework, rural Chinese postman tour and unique input output sequence concepts. In addition, an efficient algorithm for verifying the strong connectivity of the reference finite state machine and the concept of unique event sequence are explained. We made use of several techniques to from an integrated framework for abstract test case generation from LOTOS and SDL specifications. A prototype of the proposed framework has been built with special attention to real protocol in order to generate the executable test cases in an automatic way. The abstract test cases in tree and tabular combined notation (TTCN) language will be applied to the TTCN compiler in order to obtain the executable test cases which re relevant to the industrial application.