Linux temps réel embarqué et outils de développements Technique


mona a theorem prover based on automata
Installed size 751
Maintainer Ralf Treinen <treinen@debian.org>
Architecture i386
Version 1.4-7-4
Depends libc6 (>= 2.3.2.ds1-21), libgcc1 (>= 1
Suggests fping, libauthen-pam-perl, libfilesys-diskspace-perl, libnet-perl, libnet-dns-perl, libnet-ldap-perl, libnet-telnet-perl, libsnmp-perl, libstatistics-descriptive-perl
File name pool/main/m/mona/mona_1.4-7-4_i386.deb
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/.

©M.N.I.S Société | Produits | Services | Formations | Support | Partenariat | Presse | Téléchargements ©M.N.I.S