覆盖的复杂性
The Complexity of Coverage
摘要：
我们研究的问题，产生一个测试序列，实现最大覆盖率的反应式系统下测试。我们制定的问题作为一个重复的游戏之间的测试和系统，系统状态空间划分根据一些覆盖标准和测试的目标是最大限度地提高一组分区（或覆盖目标）在游戏中访问。我们证明了非确定性系统的最大覆盖问题的复杂性是PSPACE-完全的，而确定性系统的最大覆盖问题是NP-完全的。对于特殊情况下的非确定性系统与重新初始化的"重置“的行动，这表示运行一个新的测试输入重新初始化的系统，我们表明，复杂性再次co-NP-complete。我们的证明技术重置游戏使用随机测试策略，规避指数级大内存的要求，在确定性的情况下。
英文摘要：
We study the problem of generating a test sequence that achieves maximal coverage for a reactive system under test. We formulate the problem as a repeated game between the tester and the system, where the system state space is partitioned according to some coverage criterion and the objective of the tester is to maximize the set of partitions (or coverage goals) visited during the game. We show the complexity of the maximal coverage problem for non-deterministic systems is PSPACE-complete, but is NP-complete for deterministic systems. For the special case of non-deterministic systems with a re-initializing ``reset'' action, which represent running a new test input on a re-initialized system, we show that the complexity is again co-NP-complete. Our proof technique for reset games uses randomized testing strategies that circumvent the exponentially large memory requirement in the deterministic case.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
