An abstract counterexample analysis framework

Artifacts using LearnLib :: Commons :: Abstract Counterexamples (6)
Sort by:Popular

A collection of algorithms for handling counterexamples in automata learning
Last Release on Aug 13, 2026
This artifact provides the implementation of the TTT algorithm as described in the paper "The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning" (https://doi.org/10.1007/978-3-319-11164-3_26) by Malte Isberner, ...
Last Release on Aug 13, 2026
This artifact provides the implementation of the learning algorithm described in the book "An Introduction to Computational Learning Theory" by Michael Kearns and Umesh Vazirani.
Last Release on Aug 13, 2026
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 ...
Last Release on Aug 13, 2026
A learning algorithm, which distinguishes hypothesis states using a discrimination tree (visibly push-down automata variant).
Last Release on Oct 12, 2020
The TTT Algorithm (visibly push-down automata variant)
Last Release on Oct 12, 2020
  • Prev
  • 1
  • Next