AutomataLib supports modeling a variety of graph-based structures. Currently, it covers generic transition systems, Deterministic Finite Automata (DFA) and Mealy machines as well as more advanced structures such as Visibly Pushdown Automata (VPDA).

Models of AutomataLib can be (de-)serialized (from) to one of the various supported serialization formats and may be visualized using either the GraphViz or JUNG library. Furthermore, a plethora of graph-/automata-based algorithms is implemented, covering the following topics:

  • graph theory (traversal, shortest paths, strongly-connected components)
  • automata theory (equivalence, minimization)
  • model checking (adaptive distinguishing sequences, W(p)Method, characterizing sets, state cover, transition cover)


In order to start using the latest, stable release of AutomataLib in your Maven project, include the following snippet into the dependecies section of the pom.xml.

  <-- other dependencies -->

Note: This dependency will add all components of AutomataLib to your project. If you only need a subset, have a look at the List of AutomataLib Artifacts to get an overview of the individual modules available on Maven Central.

If you are not using any build management, you can also download the binaries of the AutomataLib, with and without its dependencies.

Get started Examples Wiki API docs