Benchmark problems for different models of automata, transducers, and related logics
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.settings
LTL
NFA
Parsers
SVPA
m2l-str
regex
symbolic-tree-automata
tree-automata
ws1s
.classpath
.gitignore
.project
LICENSE
README.md
importToExcel.py
instructionsForVM.txt
monaM2L.py
monaWS1S.py
pom.xml

README.md

AutomatArk (Automata Benchmark)

The goal of this project is to collect benchmark problems for different models of automata, transducers, and related logics. This will allow to have standardized sets of benchmarks for research in these topics.

Input Format

The file formats of each model are described in the readme file of the corresponding folder. We also provide parsers for LTL and tree automata. We are working on building more.

Sources

AutomataArk contains benchmark from the following sources.

Contact

You are encouraged to contribute more benchmark problems, parsers, or help in any way you want. Please contact me at loris@cs.wisc.edu or issue a pull request. If you are the owner of some of these benchmarks and don't want me to share them please contact me.

Related project

Many DFAs, NFAs, regular expressions of smaller size can be found at [https://github.com/AutomataTutor/automatatutor-data]. We do not include them in this project.