[ 原始碼： mona ]
套件：mona（1.4-17-2）
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/.
其他與 mona 有關的套件
|
|
|
|
-
- dep: libc6 (>= 2.7)
- GNU C 函式庫：共用函式庫
同時作為一個虛擬套件由這些套件填實： libc6-udeb
-
- dep: libgcc1 (>= 1:3.5)
- 套件暫時不可用
-
- dep: libstdc++6 (>= 5)
- GNU Standard C++ Library v3
-
- rec: graphviz
- rich set of graph drawing tools