mona - a decision procedure for the logics WS1S and WS2S
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.
The MONA project is a research project at the BRICS Research
Center at University of Aarhus, Denmark.
Full documentation, GPL source code, and related research papers are
available from the MONA project home page at
Output whole automaton. Default is to only output its size.
Don't analyze automaton. Default is to analyze for validity and
unsatisfiability and to generate a satisfying example and
Print elapsed time for each phase. If -s is also used, the time for
each automaton operation is also printed.
Print statistics. Prints information for each automaton operation and
Print intermediate automata (implies -s).
Dump AST, symboltable, and code DAG. Useful for debugging.
Quiet, don't print progress.
Enable separate compilation. (See the MONALIB environment variable below.)
Code optimization level N (0=none, 1=safe, 2=heuristic) (default 1).
Disable BDD index reordering, use order of declaration as index ordering.
Default is to reorder BDD indices heuristically.
Force normal tree-mode output style. Only applicable for WSRT mode.
Alternative M2L-Str emulation (v1.3 style).
Enable inherited acceptance analysis.
Unrestrict output automata. Create conventional automata by converting
"don't-care" states to "reject" states and minimizes.