Scholarlink

The paper is devoted to an efficient distinguishing sequence (DS) generation. DSs are widely used in model-based testing against Finite State Machines (FSMs), however the problem of their existence check is PSPACE-complete. Homing sequences (HSs), on the contrary, are usually shorter than DSs, and their existence can be checked faster. We therefore, study the cases when a DS can be substituted with an HS, and discuss whenever such substitution brings a shorter test case. The approach is promising under the white box testing assumption, i.e., when all potential implementations are enumerated explicitly.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On Using Homing Sequences Instead of Distinguishing in FSM-Based Testing

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Natalia Kushik,
  • Nina Yevtushenko

摘要

The paper is devoted to an efficient distinguishing sequence (DS) generation. DSs are widely used in model-based testing against Finite State Machines (FSMs), however the problem of their existence check is PSPACE-complete. Homing sequences (HSs), on the contrary, are usually shorter than DSs, and their existence can be checked faster. We therefore, study the cases when a DS can be substituted with an HS, and discuss whenever such substitution brings a shorter test case. The approach is promising under the white box testing assumption, i.e., when all potential implementations are enumerated explicitly.