Model Learning as a Satisfiability Modulo Theories Problem

Rick Smetsers, P. Fiterau-Brostean, and F.W. Vaandrager Model Learning as a Satisfiability Modulo Theories Problem. In S.T. Klein et al, editors. Proceedings 12th International Conference on Language and Automata Theory and Applications (LATA), Bar-Ilan, Israel, April 9-11, 2018. LNCS 10792, pp. 182-194, 2018.


We explore an approach to model learning that is based on using \emph{satisfiability modulo theories} (SMT) solvers. To that end, we explain how DFAs, Mealy machines and register automata, and observations of their behavior can be encoded as logic formulas. An SMT solver is then tasked with finding an assignment for such a formula, from which we can extract an automaton of minimal size. We provide an implementation of this approach which we use to conduct experiments on a series of benchmarks. These experiments address both the scalability of the approach and its performance relative to existing active learning tools.

Local copy (pdf)
Published version
Full version (pdf)
Slides (pdf)
Source code and data