AbstractModel checking has a long-standing tradition in software verification. Given a system design it checks whether desired properties are satisfied. Unlike testing, it cannot be applied in a black-box setting. To overcome this limitation Peled et al. introduced black-box checking, a combination of testing, model inference and model checking. The technique requires systems to be fully deterministic. For stochastic systems, statistical techniques are available. However, they cannot be applied to systems with non-deterministic choices. We present a black-box checking technique for stochastic systems that allows both, non-deterministic and probabilistic behaviour. It involves model inference, testing and probabilistic model-checking. Here, we consider reachability checking, i.e., we infer near-optimal input-selection strategies for bounded reachability.

中文翻译：

---

概率黑盒可达性检查（扩展版）

Abstract 模型检查在软件验证中有着悠久的传统。给定一个系统设计，它检查是否满足所需的特性。与测试不同，它不能应用于黑盒设置。为了克服这一限制，Peled 等人。引入了黑盒检查，即测试、模型推理和模型检查的组合。该技术要求系统具有完全确定性。对于随机系统，可以使用统计技术。但是，它们不能应用于具有非确定性选择的系统。我们提出了一种用于随机系统的黑盒检查技术，它允许非确定性和概率行为。它涉及模型推理、测试和概率模型检查。在这里，我们考虑可达性检查，即