• 综合
  • 标题
  • 关键词
  • 摘要
  • 学者
  • 期刊-刊名
  • 期刊-ISSN
  • 会议名称
搜索

作者:

Fu, Lihua (Fu, Lihua.) | Wang, Dan (Wang, Dan.) | Kuang, Jinyun (Kuang, Jinyun.)

收录:

EI Scopus

摘要:

In conformance testing, it is crucial to have short and efficient test sequences for faster processing. As the key component of trusted computing platform, the conformance testing efficiently for trust chain is very necessary. In contrast to Unique Input/Output(UIO) sequence, Backward Unique Input/Output(BUIO) sequence is a sequence that uniquely distinguishes a state, where the identified state is the end state in the sequence. Therefore, this paper focuses on the algorithm for constructing BUIO sequences of trust chain specifications FSM model based on successor tree. And the authors analyze the test sequence generation procedures with BUIO sequences. Empirical evidence indicates that the proposed method yields a shorter conformance test sequence for trust chain compared with UIO-based method. Copyright © 2011 Binary Information Press.

关键词:

Finite automata Trees (mathematics)

作者机构:

  • [ 1 ] [Fu, Lihua]College of Computer Science, Beijing University of Technology, Beijing 100124, China
  • [ 2 ] [Wang, Dan]College of Computer Science, Beijing University of Technology, Beijing 100124, China
  • [ 3 ] [Kuang, Jinyun]College of Computer Science, Beijing University of Technology, Beijing 100124, China

通讯作者信息:

电子邮件地址:

查看成果更多字段

相关关键词:

相关文章:

来源 :

Journal of Computational Information Systems

ISSN: 1553-9105

年份: 2011

期: 11

卷: 7

页码: 4153-4160

被引次数:

WoS核心集被引频次: 0

SCOPUS被引频次:

ESI高被引论文在榜: 0 展开所有

万方被引频次:

中文被引频次:

近30日浏览量: 2

在线人数/总访问数:1583/2983823
地址:北京工业大学图书馆(北京市朝阳区平乐园100号 邮编:100124) 联系我们:010-67392185
版权所有:北京工业大学图书馆 站点建设与维护:北京爱琴海乐之技术有限公司