Artifacts using LearnLib :: Oracles :: Membership Oracles (20)

Support classes for easily writing integration test cases for learning algorithms

A collection of equivalence oracles

Caches to avoid posing duplicate membership queries

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" ...

Support for parallel membership queries and thread-safe caches

Basic Test Driver Generation Support

This artifact provides the implementation of the Observation-Pack learning algorithm as described in the PhD thesis "Active learning of interface programs" (http://dx.doi.org/10.17877/DE290R-4817) by Falk Howar.

This artifact provides the implementation of the DHC learning algorithm as described in the paper "Automata Learning with on-the-Fly Direct Hypothesis Construction" (https://doi.org/10.1007/978-3-642-34781-8_19) by Maik Merten, Falk Howar, Bernhard Steffen, and Tiziana Margaria.

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, Falk Howar, and Bernhard Steffen.

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