返回
State identification sequences from the splitting tree
DOI:10.1016/j.infsof.2020.106297.png)
摘要
En 中文
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.
Keyword:
Splitting tree
Separating sequence
Harmonized state identifiers
Adaptive distinguishing sequence
Finite-state machine
Software testing
Regular inference
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
3.8K
被引数:
7.7K
机构
引用论文
Along‐strike variations in underthrust sediment dewatering on the Nicoya margin, Costa Rica related to the updip limit of seismicity哥斯达黎加尼科亚边缘的下冲沉积物脱水的罢工变化与地震活动的上升极限有关

