• Title/Summary/Keyword: synchronizable state identification sequence

Search Result 2, Processing Time 0.021 seconds

A Heuristic Technique for Generating the Synchronizable and Optimized Conformance Test Sequences (최적화된 동기적 적합성시험 항목의 발견적 생성 방법)

  • Kim, Chul
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.6
    • /
    • pp.470-477
    • /
    • 2015
  • This paper presents a new technique for generating an optimum synchronizable test sequence that can be applied in the distributed test architecture where both external synchronization and input/output operation costs are taken into consideration. The method defines a set of phases that constructs a tester-related digraph from a given finite state machine representation of a protocol specification such that a minimum cost tour of the digraph with intrinsically synchronizable transfer sequences can be used to generate an optimum synchronizable test sequence using synchronizable state identification sequences as the state recognition sequence for each state of the given finite state machine. This hybrid approach with a heuristic and optimization technique provides a simple and 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.

On the Generation of Synchronizable Conformance Test Sequences Using the Duplex Digraph and Distinguishing Sequences (이중 방향그래프와 구별시퀀스를 이용한 동기적 적합시험 항목의 생성)

  • Kim, Chul;Song, Joo-Seok
    • 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.

  • PDF