Artifacts using automata-serialization-dot version 0.12.0

This artifact provides various common utility operations for analyzing and manipulating automata and graphs, such as traversal, minimization and copying.

Module for data structures shared by multiple learning algorithms of LearnLib

This artifact contains algorithms for incrementally constructing DFAs (prefix-closed and non-prefix-closed), Mealy machines, and Moore machines from a finite, incrementally growing set of example inputs/outputs.

This artifact provides the implementations of various learning algorithms based on the "lazy partition refinement" concept as described in the paper "Active Automata Learning as Black-Box Search and Lazy Partition Refinement" (https://doi.org/10.1007/978-3-031-15629-8_17) by Falk Howar and Bernhard Steffen.

An artifact that aggregates all other artifacts of AutomataLib 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 AutomataLib artifacts.

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.

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.

Reuse Tree for (intelligently) caching membership queries

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.

This artifact provides the implementation of the model checker presented in the paper "M3C: Modal Meta Model Checking" (https://doi.org/10.1007/978-3-030-00244-2_15) by Bernhard Steffen and Alnis Murtovi. The paper is based on "Model Checking for Context-Free Processes" (https://doi.org/10.1007/BFb0084787) by Olaf Burkart and Bernhard Steffen. Note that this implementation requires a runtime dependency to a specific ADDLib backend (see https://add-lib.scce.info/), ...