This artifact provides the implementation of the L* learning algorithm described in the paper "Learning Regular Sets from Queries and Counterexamples" (https://doi.org/10.1016/0890-5401(87)90052-6) by Dana Angluin including variations and optimizations thereof such as the versions based on "On the Learnability of Infinitary Regular Sets" (https://doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" ...

Reuse Tree for (intelligently) caching membership queries as described in the paper "Reusing System States by Active Learning Algorithms" (https://doi.org/10.1007/978-3-642-28033-7_6) by Oliver Bauer, Johannes Neubauer, Bernhard ...

An artifact that aggregates all other artifacts of LearnLib to produce an Uber-JAR that can be used in non-maven environments. Likewise, this single artifact may be used in maven-aware environments to declare a dependency on all ...

This artifact provides the implementation of the AAAR learning algorithm as described in the paper "Automata Learning with Automated Alphabet Abstraction Refinement" (https://doi.org/10.1007/978-3-642-18275-4_19) by Falk Howar, ...

This artifact provides the implementations of various learning algorithms for systems of procedural automata such as the ones described in the papers "Compositional learning of mutually recursive procedural systems ...

A generic, modular, and extensible protocol state fuzzer for network protocol implementations.