Context: Software testing based on finite-state machines.

Objective:Improving the performance of existing testing methods by construction of more efficient separating sequences, so that states entered by a system under test can be identified in a much shorter span of time.

Method: This paper proposes an efficient way to construct separating sequences for subsets of states for any deterministic finite-state machine. It extends an existing algorithm that builds an adaptive distinguishing sequence (ADS) from a splitting tree to machines that do not possess an ADS. Our extension to this construction algorithm allows one not only to construct a separating sequence for any subset of states but also form sets of separating sequences, such as harmonized state identifiers (HSI) and incomplete adaptive distinguishing sequences, that are used by efficient testing and learning algorithms.

Results: The experiments confirm that the length and number of test sequences produced by testing methods that use HSIs constructed by our extension is significantly improved.

Conclusion:By constructing more efficient separating sequences the performance of existing test methods significantly improves.

背景信息：基于有限状态机的软件测试。

目的：通过构建更有效的分离序列来改善现有测试方法的性能，以便可以在更短的时间内识别被测系统输入的状态。

方法：本文提出了一种有效的方法来为任何确定性有限状态机构造状态子集的分离序列。它扩展了现有的算法，该算法将从分裂树构建自适应区分序列（ADS）到不具有ADS的机器。我们对这种构造算法的扩展不仅允许为任何状态子集构造一个分离序列，而且还可以形成分离序列集，例如通过有效的测试和学习使用的统一状态标识符（HSI）和不完整的自适应区分序列算法。

结果：实验证实，通过使用我们扩展构建的HSI的测试方法生成的测试序列的长度和数量得到了显着改善。

结论：通过构建更有效的分离序列，现有测试方法的性能显着提高。