Scholarlink

We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the \(L^{\#}\) algorithm of Vaandrager et al. to a timed setting. We rely on symbolic queries which empower us to reason on untimed executions while learning. Similarly to the algorithm for learning timed automata of Waga, these symbolic queries can be realized using finitely many concrete queries. Experiments with a prototype implementation show that our algorithm is able to efficiently learn realistic benchmarks.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Active Learning of Mealy Machines with Timers

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Véronique Bruyère,
  • Bharat Garhewal,
  • Guillermo A. Pérez,
  • Gaëtan Staquet,
  • Frits W. Vaandrager

摘要

We present the first algorithm for query learning Mealy machines with timers in a black-box context. Our algorithm is an extension of the \(L^{\#}\) algorithm of Vaandrager et al. to a timed setting. We rely on symbolic queries which empower us to reason on untimed executions while learning. Similarly to the algorithm for learning timed automata of Waga, these symbolic queries can be realized using finitely many concrete queries. Experiments with a prototype implementation show that our algorithm is able to efficiently learn realistic benchmarks.