MONA(1)

NAME
mona - a theorem prover based on automata

SYNOPSIS
mona [options] files...

DESCRIPTION
This manual page documents briefly the mona command. This manual page was written for the Debian GNU/Linux distribution because the original program does not have a manual page.

Mona is a tool that translates formulas in the logics WS1S or WS2S into finite-state automata represented by BDDs. The formulas may express search patterns, temporal properties of reactive systems, parse tree constraints, etc. Mona also analyses the automaton resulting from the compilation, and determines whether the formula is valid and, if the formula is not valid, generates a counter-example.

Due to copyright restrictions, the mona documentation can currently not be redistributed with the debian package. We hope that this situation will be improved with future versions of the documentation.

Typing mona without arguments displays the command-line usage. The documentation can be obtained from the projet web site http://www.brics.dk/mona

AUTHOR
This manual page was written by Ralf Treinen <treinen@debian.org>, for the Debian GNU/Linux system (but may be used by others).