We present an algorithm for active learning of deterministic timed automata with a single clock. The algorithm is within the framework of Angluin's $L^*$ algorithm and inspired by existing work on the active learning of symbolic automata. Due to the need of guessing for each transition whether it resets the clock, the algorithm is of exponential complexity in the size of the learned automata. Before presenting this algorithm, we propose a simpler version where the teacher is assumed to be smart in the sense of being able to provide the reset information. We show that this simpler setting yields a polynomial complexity of the learning process. Both of the algorithms are implemented and evaluated on a collection of randomly generated examples. We furthermore demonstrate the simpler algorithm on the functional specification of the TCP protocol.

中文翻译：

---

学习一时钟定时自动机

我们提出了一种使用单个时钟主动学习确定性定时自动机的算法。该算法在 Angluin 的 $L^*$ 算法的框架内，并受到符号自动机主动学习现有工作的启发。由于需要猜测每次转换是否重置时钟，因此该算法在学习自动机的大小方面具有指数复杂性。在介绍这个算法之前，我们提出了一个更简单的版本，其中教师在能够提供重置信息的意义上被认为是聪明的。我们表明，这种更简单的设置会产生学习过程的多项式复杂性。这两种算法都是在一组随机生成的示例上实现和评估的。我们进一步在 TCP 协议的功能规范上演示了更简单的算法。