| 1 |
Source: mona |
| 2 |
Section: science |
| 3 |
Priority: optional |
| 4 |
Maintainer: Debian Science Maintainers <[email protected]> |
| 5 |
Uploaders: Ralf Treinen <[email protected]> |
| 6 |
Build-Depends: debhelper-compat (=13), bison, flex |
| 7 |
Standards-Version: 4.6.0 |
| 8 |
Rules-Requires-Root: no |
| 9 |
Homepage: https://www.brics.dk/mona/ |
| 10 |
Vcs-Git: https://salsa.debian.org/science-team/mona.git |
| 11 |
Vcs-Browser: https://salsa.debian.org/science-team/mona |
| 12 |
|
| 13 |
Package: mona |
| 14 |
Architecture: any |
| 15 |
Depends: ${shlibs:Depends}, ${misc:Depends} |
| 16 |
Recommends: graphviz |
| 17 |
Description: theorem prover based on automata |
| 18 |
MONA is a tool that translates formulas in the logics WS1S or WS2S |
| 19 |
into finite-state automata represented by BDDs. The formulas may |
| 20 |
express search patterns, temporal properties of reactive systems, |
| 21 |
parse tree constraints, etc. MONA also analyses the automaton |
| 22 |
resulting from the compilation, and determines whether the formula is |
| 23 |
valid and, if the formula is not valid, generates a counter-example. |
| 24 |
. |
| 25 |
Documentation is available from the MONA website http://www.brics.dk/mona/. |