Active Learning of Mealy Machines with Timers

arXiv:2403.02019v1 Announce Type: cross
Abstract: We present the first algorithm for query learning of a general class of Mealy machines with timers (MMTs) in a black-box context. Our algorithm is an extension of the L# algorithm of Vaandrager et al. to a timed setting. Like the algorithm for learning timed automata proposed by Waga, our algorithm is inspired by ideas of Maler & Pnueli. Based on the elementary languages of, both Waga's and our algorithm use symbolic queries, which are …

abstract active learning algorithm arxiv box class context cs.fl cs.lg extension general machines query the algorithm type