Artifacts using learnlib-equivalence-oracles version 0.17.0
Support classes for easily writing integration test cases for learning algorithms
Last Release on Feb 6, 2025
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" ...
Last Release on Feb 6, 2025
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.
Last Release on Feb 6, 2025
This artifact provides the implementation of the Observation-Pack learning algorithm as described in the PhD
thesis "Active learning of interface programs" (http://doi.org/10.17877/DE290R-4817) by Falk Howar.
Last Release on Feb 6, 2025
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.
Last Release on Feb 6, 2025
This artifact provides the implementation of the VPA adaption of the Observation-Pack learning algorithm as
discussed in the PhD thesis "Foundations of Active Automata Learning: An Algorithmic Perspective"
(https://doi.org/10.17877/DE290R-16359) by Malte Isberner.
Last Release on Feb 6, 2025
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, Bernhard Steffen, and Maik Merten.
Last Release on Feb 6, 2025
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.
Last Release on Feb 6, 2025
This artifact provides the implementation of the NL* learning algorithm as described in the paper "Angluin-Style
Learning of NFA" (http://ijcai.org/Proceedings/09/Papers/170.pdf) by Benedikt Bollig, Peter Habermehl,
Carsten Kern, and Martin Leucker.
Last Release on Feb 6, 2025
- Prev
- 1
- Next