Artifacts using LearnLib :: Drivers :: Simulator (9)

Support classes for easily writing integration test cases for learning algorithms

A collection of membership oracles

Caches to avoid posing duplicate membership queries

Support for parallel membership queries and thread-safe caches

Filters for collecting statistical data

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://dx.doi.org/10.1006/inco.1995.1070) by Oded Maler and Amir Pnueli or "Inference of finite automata using homing sequences" ...

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 LearnLib artifacts.

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 (https://doi.org/10.1007/s10009-021-00634-y) and "From Languages to Behaviors and Back" (https://doi.org/10.1007/978-3-031-15629-8_11) by Markus Frohme and Bernhard Steffen.

This artifact provides the implementation of the ADT learning algorithm as described in the Master thesis "Active Automata Learning with Adaptive Distinguishing Sequences" (http://arxiv.org/abs/1902.01139) by Markus Frohme.