Testing on reactive systems is a well-known laborious activity on software development due to their asynchronous interaction with the environment. In this setting model based testing has been employed when checking conformance and generating test suites of such systems using labeled transition system as a formalism as well as the classical ioco conformance relation. In this work we turn to a more complex scenario where the target systems have an auxiliary memory, a stack. We then studied a more powerful model, the Visibly Pushdown Labeled Transition System (VPTS), its variant Input/Output VPTS (IOVPTS), its associated model Visibly Pushdown Automaton (VPA), and aspects of conformance testing and test suite generation. This scenario is much more challenge since the base model has a pushdown stack to capture more complex behaviors which commonly found on reactive systems. We then defined a more general conformance relation for pushdown reactive systems such that it prevents any observable implementation behavior that was not already present in the given specification. Further we gave an efficient algorithm to check conformance in this testing scenario and also showed that it runs in worst case asymptotic polynomial time in the size of both the given specification and the implementation that are put under test.

中文翻译：

---

测试下推系统

由于响应式系统与环境的交互是异步的，因此对反应式系统进行测试是众所周知的软件开发的费力活动。在这种设置中，在使用标记转换系统作为形式主义以及经典的 ioco 一致性关系检查一致性和生成此类系统的测试套件时，已采用基于模型的测试。在这项工作中，我们转向一个更复杂的场景，其中目标系统有一个辅助内存，一个堆栈。然后，我们研究了一个更强大的模型，可见下推标记转换系统 (VPTS)、其变体输入/输出 VPTS (IOVPTS)、其相关模型可见下推自动机 (VPA)，以及一致性测试和测试套件生成的各个方面。这个场景更具挑战性，因为基础模型有一个下推堆栈来捕获更复杂的行为，这些行为通常在反应式系统中发现。然后，我们为下推反应式系统定义了一个更通用的一致性关系，以防止给定规范中尚未出现的任何可观察的实现行为。此外，我们提供了一种有效的算法来检查此测试场景中的一致性，并且还表明它在最坏情况下的渐近多项式时间内以给定的规范和被测试的实现的大小运行。