Group: net.automatalib - All Dependencies

AutomataLib :: API · This artifact contains the API of AutomataLib, which mainly consists of interfaces for the various concepts and automaton models supported by the AutomataLib core. In addition to that, it also defines some fundamental classes for dealing with words of symbols.

AutomataLib :: Core · The core artifact of AutomataLib. This library contains concrete implementations for many of the automaton model interfaces defined in the API artifact, as well as abstract base classes that facilitate implementing new automaton model classes. Note that concrete algorithms (traversal, reachability analysis etc.) are not in the scope of this artifact.

AutomataLib :: Commons :: Utilities · Basic utility library containing several useful classes (e.g., a Pair class) to ease everyday programming.

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

AutomataLib :: Commons :: Smart Collections · This library provides efficient implementations for various collection data structures (esp. linked lists and priority queues), which have very insufficient implementation in the Java Collections Foundations that makes it hard or even impossible to exploit their efficiencies.

AutomataLib :: Serialization :: Core · Generic automata serialization core

AutomataLib :: Commons :: DOT Utilities · This utility artifact contains methods that facilitate interaction with the <a href="http://www.graphviz.org/">GraphVIZ DOT</a> tool, and allows to render and display DOT models directly from within the application.

AutomataLib :: Serialization :: DOT · (De-)Serializers for the DOT Format

AutomataLib :: Visualization :: JUNG Visualizer · Visualizer using the Java Utility for Networks and Graphs

AutomataLib :: Incremental · A library for incremental automata construction. This artifact contains algorithms for incrementally constructing DFAs (both prefix-closed and non-prefix-closed) and Mealy machines from a finite, incrementally growing set of example inputs/outputs.

AutomataLib :: Serialization :: FSM · Deserializers for the Finite State Machine format

AutomataLib :: Adapters :: BRICS · This artifact contains adapter classes for treating the Automaton objects from the BRICS library (http://www.brics.dk/automaton) as AutomataLib models.

AutomataLib :: Serialization :: ETF · Serializers for LTSmin's Enumerated Table Format

AutomataLib :: Serialization :: TAF · (De-)Serializers for the Textual Automaton Format

AutomataLib :: Serialization :: LearnLibV2 · (De-)Serializers for the legacy LearnLibV2 format

AutomataLib :: Serialization :: SAF · (De-)Serializers for the Simple Automaton Format

AutomataLib :: Serialization :: AUT · (De-)Serializers for the AUT Format

AutomataLib :: Visualization :: DOT Visualizer · This artifact contains a visualization implementation for the GraphVIZ DOT (http://www.graphviz.org/) tool.

AutomataLib :: Model Checking :: LTSmin · LTSmin Model Checker

AutomataLib · A fully generic library for automata, graphs, and models, written in Java. This is the parent artifact which does not have any source code. Please refer to the "modules" page for more detailed documentation on the single library artifacts.

AutomataLib :: Commons · Common parent metaproject for various small Java libraries which are required by AutomataLib, but are not specific to AutomataLib itself (i.e., are not or only indirectly related to modeling automata and graphs).

AutomataLib :: Visualization · Automata and Graph visualization libraries.

AutomataLib :: Serialization · Serialization parent metaproject for various (de-)serialization methods.

AutomataLib :: Misc :: Misc. Algorithms · This artifact contains several miscellaneous, well-known algorithms, which however are rather specific in their concrete use case and therefore not fit for the AutomataLib Utilities library. Examples include Dijkstra's algorithm for the SSSP problem, the Floyd-Warshall algorithm for the APSP problem and Tarjan's algorithm for finding all strongly-connected components in a graph.