首页> 外文期刊>Science of Computer Programming >Finite complete suites for CSP refinement testing
【24h】

Finite complete suites for CSP refinement testing

机译:有限的完整套件,用于CSP优化测试

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, new contributions for model-based testing using Communicating Sequential Processes (CSP) are presented. For a finite non-terminating CSP process representing the reference model, finite test suites for checking the conformance relations traces and failures refinement are presented, and their completeness (that is, capability to uncover conformity violations) is proven. The fault domains for which complete failure detection can be guaranteed are specified by means of normalised transition graphs representing the failures semantics of finite-state CSP processes. While complete test suites for CSP processes have been previously investigated by several authors, a sufficient condition for their finiteness is presented here for the first time. Moreover, it is shown that the test suites are optimal in two aspects: (a) the maximal length of test traces cannot be further reduced, and (b) the nondeterministic behaviour cannot be tested with smaller or fewer sets of events, without losing the test suite's completeness property. (C) 2019 Elsevier B.V. All rights reserved.
机译:在本文中,提出了使用通信顺序过程(CSP)进行基于模型的测试的新贡献。对于表示参考模型的有限非终止CSP过程,提出了用于检查一致性关系迹线和故障细化的有限测试套件,并证明了它们的完整性(即发现违规性的能力)。可以通过表示有限状态CSP流程的故障语义的归一化过渡图指定可以保证完全故障检测的故障域。尽管几位作者先前已经研究过用于CSP流程的完整测试套件,但这里还是首次提出了其有限性的充分条件。此外,还表明,测试套件在两个方面都是最佳的:(a)测试迹线的最大长度不能进一步减小;(b)不能用更少或更少的事件集来测试不确定性行为,而又不会失去测试套件的完整性属性。 (C)2019 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号