并发黑盒测试系统--自动机理论与分解方法
Testing Systems of Concurrent Black-boxes--an Automata-Theoretic and Decompositional Approach
摘要：
本文研究的全局测试问题是在给定的有限（但可能是巨大的）集合“Bad”中寻求并发黑盒系统是否具有可观察行为的确定答案。我们介绍了一种新的方法来解决这个问题，不需要集成测试。相反，在我们的方法中，全局测试问题被简化为以给定的顺序逐个测试系统中的各个黑盒。使用自动机理论的方法，每个单独的黑盒的测试序列生成从系统的描述，以及测试结果的黑盒之前，这个黑盒在给定的顺序。与传统的组合/模块化验证/测试方法相比，我们的方法基本上是分解的。此外，我们的技术是完整的，声音，并可以自动执行。我们的实验结果表明，需要解决的全球测试问题的测试总数是相当小的，即使是一个非常大的“坏”。
英文摘要：
The global testing problem studied in this paper is to seek a definite answer to whether a system of concurrent black-boxes has an observable behavior in a given finite (but could be huge) set "Bad". We introduce a novel approach to solve the problem that does not require integration testing. Instead, in our approach, the global testing problem is reduced to testing individual black-boxes in the system one by one in some given order. Using an automata-theoretic approach, test sequences for each individual black-box are generated from the system's description as well as the test results of black-boxes prior to this black-box in the given order. In contrast to the conventional compositional/modular verification/testing approaches, our approach is essentially decompositional. Also, our technique is complete, sound, and can be carried out automatically. Our experiment results show that the total number of tests needed to solve the global testing problem is substantially small even for an extremely large "Bad".
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
