Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2007, Vol. 30 ›› Issue (2): 84-88.doi: 10.13190/jbupt.200702.84.shut

• Papers • Previous Articles     Next Articles

A Novel Algorithm for Generating Executable State Identification Sequences in EFSM Model

SHU Ting,WEI Yang-su,WU Bai-qing,MENG Zhao-hang   

  1. (College of Informatics and Electronics, Zhejiang SCI-TECH University, Hangzhou 310018, China)
  • Received:2006-05-08 Revised:1900-01-01 Online:2007-04-30 Published:2007-04-30
  • Contact: SHU Ting

Abstract:

In a protocol conformance testing system specified in the extended finite state machine (EFSM) model, a novel method of executable state identification sequences (ESIS) generation is introduced to preferably solve the executability problem of state identification sequences (SIS). The approach, from the aspect of state identification demand and the EFSM configure projection subspace, adopts fractional-step computation to generate the shortest ESIS in the specific identification scene through searching a executability analysis tree (EAT) in bread-first-search way. As a result, the complexity of computing all state identification sequences using single-step method in the whole state configure space is reduced. The experiment results show that the proposed algorithm is effective to generate executable state identification sequences in EFSM model.

Key words: protocol conformance test;extended finite state machine;state identification, unique input/output sequence

CLC Number: