n-Complete test suites for IOCO

n-Complete test suites for IOCO
复制标题

n-IOCO 完整测试套件

DOI:
--
复制
发表时间:
2018
影响因子:
1.9
通讯作者:
Joshua Moerman
Joshua Moerman
中科院分区:
计算机科学4区
文献类型:
--
作者:
Petra van den Bos;Ramon Janssen;Joshua Moerman

文献摘要

被引文献

相似文献

自动机的n-完全测试套件保证检测到具有有限数量状态的所有错误实现。我们提出了这样一个测试套件的建设ioco一致性标记的过渡系统,我们来自确定性FSM的建设方法。除了测试执行中的状态数量和公平性之外,我们生成的测试套件对实现没有进一步的限制。这提高了现有方法中的限制。特别是,我们解决问题的兼容状态:规范状态,可以实现一个单一的状态。现有的ioco方法禁止这样的状态,因为它们使测试集的构造复杂化。
An n-complete test suite for automata guarantees to detect all faulty implementations with a bounded number of states. We propose a construction of such a test suite for ioco conformance on labeled transition systems, which we derive from construction methods for deterministic FSMs. Our resulting test suite poses no further restrictions on the implementations other than their number of states and fairness in test execution. This elevates restrictions made in existing methods. In particular, we address the problem of compatible states: specification states which can be implemented by a single state. Such states are forbidden by existing methods for ioco, as they complicate test suite construction.