Source: mona
Section: science
Priority: optional
Maintainer: Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
Uploaders: Ralf Treinen <treinen@debian.org>
Build-Depends: debhelper-compat (=12), bison, flex
Standards-Version: 4.4.0
Homepage: http://www.brics.dk/~amoeller/mona/index.html
Vcs-Git: https://salsa.debian.org/science-team/mona.git
Vcs-Browser: https://salsa.debian.org/science-team/mona

Package: mona
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Recommends: graphviz
Description: theorem prover based on automata
 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/.