
arXiv: 2403.02019
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.
57 pages, 13 figures. Published at QEST+FORMATS 2025
Machine Learning, FOS: Computer and information sciences, model learning, Timed systems, Formal Languages and Automata Theory (cs.FL), active automata learning, F.4.3, 68Q45, [INFO] Computer Science [cs], Formal Languages and Automata Theory, Machine Learning (cs.LG)
Machine Learning, FOS: Computer and information sciences, model learning, Timed systems, Formal Languages and Automata Theory (cs.FL), active automata learning, F.4.3, 68Q45, [INFO] Computer Science [cs], Formal Languages and Automata Theory, Machine Learning (cs.LG)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
