Binary package “mona” in ubuntu trusty
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://
Source package
Published versions
- mona 1.4-13-3 in amd64 (Release)
- mona 1.4-13-3ubuntu1 in amd64 (Proposed)
- mona 1.4-13-3ubuntu1 in amd64 (Release)
- mona 1.4-13-3ubuntu1 in arm64 (Proposed)
- mona 1.4-13-3ubuntu1 in arm64 (Release)
- mona 1.4-13-3 in armhf (Release)
- mona 1.4-13-3ubuntu1 in armhf (Proposed)
- mona 1.4-13-3ubuntu1 in armhf (Release)
- mona 1.4-13-3 in i386 (Release)
- mona 1.4-13-3ubuntu1 in i386 (Proposed)
- mona 1.4-13-3ubuntu1 in i386 (Release)
- mona 1.4-13-3 in powerpc (Release)
- mona 1.4-13-3ubuntu1 in powerpc (Proposed)
- mona 1.4-13-3ubuntu1 in powerpc (Release)
- mona 1.4-13-3ubuntu1 in ppc64el (Release)
