Debian logoDebian Screenshots >

mona

theorem prover based on automata

Description

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.

Documentation is available from the MONA website http://www.brics.dk/mona/.

Homepage

http://www.brics.dk/~amoeller/mona/index.html


Upload more screenshots

Please help extend the collection of screenshots. Just make a screenshot and upload it here. You don't need to register or anything.