Finite complete suites for CSP refinement testing
Finite complete suites for CSP refinement testing
复制标题
DOI：
10.1016/j.scico.2019.04.004
复制
发表时间：
2019-06
期刊：
影响因子：
--
通讯作者：
J. Peleska;Wen-ling Huang;Ana Cavalcanti
中科院分区：
文献类型：
--
作者：
J. Peleska;Wen-ling Huang;Ana Cavalcanti
在本文中，基于模型的测试使用通信顺序进程（CSP）的新贡献。对于一个有限的非终止CSP过程代表的参考模型，有限的测试套件检查一致性关系的痕迹和故障细化，并证明其完整性（即，能力，发现一致性违规）。通过表示有限状态CSP过程的故障语义的规范化转换图，可以保证完整的故障检测的故障域指定。虽然完整的测试套件的CSP过程中，以前已经研究了几个作者，他们的有限性的充分条件在这里首次提出。此外，它示出的测试套件是最佳的在两个方面：（a）的测试轨迹的最大长度不能进一步减少，和（B）的不确定性行为不能测试更小或更少的事件集，而不会失去测试套件的完整性属性。
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.