LearnLib: a framework for extrapolating behavioral models. In this paper, we present the LearnLib, a library of tools for automata learning, which is explicitly designed for the systematic experimental analysis of the profile of available learning algorithms and corresponding optimizations. Its modular structure allows users to configure their own tailored learning scenarios, which exploit specific properties of their envisioned applications. As has been shown earlier, exploiting application-specific structural features enables optimizations that may lead to performance gains of several orders of magnitude, a necessary precondition to make automata learning applicable to realistic scenarios.
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Cassel, Sofia; Howar, Falk; Jonsson, Bengt; Steffen, Bernhard: Active learning for extended finite state machines (2016)
- Aarts, Fides; Jonsson, Bengt; Uijen, Johan; Vaandrager, Frits: Generating models of infinite-state communication protocols using regular inference with abstraction (2015)
- Aarts, Fides; Kuppens, Harco; Tretmans, Jan; Vaandrager, Frits; Verwer, Sicco: Improving active Mealy machine learning for protocol conformance testing (2014)
- Chen, Yu-Fang; Wang, Bow-Yaw: BULL: a library for learning algorithms of Boolean functions (2013)
- Howar, Falk; Steffen, Bernhard; Merten, Maik: Automata learning with automated alphabet abstraction refinement (2011)
- Raffelt, Harald; Merten, Maik; Steffen, Bernhard; Margaria, Tiziana: Dynamic testing via automata learning (2009)