Group: LearnLib

Sort by:Popular▼

✓Popular✓Newest

An abstract counterexample analysis framework

A flexible, optimized version of Dana Angluin's L* algorithm

Annotations and processors for the LearnLib build process

Common interfaces providing features supported by various learning algorithms

A learning algorithm, which distinguishes hypothesis states using a discrimination tree.

A learning algorithm, which distinguishes hypothesis states using a discrimination tree (visibly push-down automata variant).

A simple, straightforward implementation of Dana Angluin's L* algorithm

The TTT Algorithm (visibly push-down automata variant)

Parent module for automata learning algorithms shipped with LearnLib

Tools and resources required for building LearnLib

Tools and resources required for building LearnLib

Parent module for test drivers

Parent module for equivalence testing algorithms shipped with LearnLib

A collection of examples of how to use LearnLib

Parent module for queries that can be used to speed up the learning process

Parent module for LearnLib utilities