Difference between revisions of "MONA"
(Created page with "{{Entry |Name=MONA |Short description=a tool that translates formulas to finite-state automata. |Full description=MONA is a tool that translates formulas to finite-state automata...") |
(New version) |
||
| Line 3: | Line 3: | ||
|Short description=a tool that translates formulas to finite-state automata. | |Short description=a tool that translates formulas to finite-state automata. | ||
|Full description=MONA is a tool that translates formulas to finite-state automata. The formulas may express search patterns, temporal properties of reactive systems, parse tree constraints, etc. MONA analyses the automaton resulting from the compilation and prints out "valid" or a counter-example. MONA implements decision procedures for the Weak Second-order Theory of One or Two successors (WS1S/WS2S). The theory of one successor, known as WS1S, is a fragment of arithmetic augmented with second-order quantification over finite sets of natural numbers. Its first-order terms denote just natural numbers. The theory has no addition, since that would make it undecidable, but it has a unary operation +1, known as the successor function. WS2S is a generalization to tree structures. Since the theories are monadic second-order logics, we call our tool MONA. | |Full description=MONA is a tool that translates formulas to finite-state automata. The formulas may express search patterns, temporal properties of reactive systems, parse tree constraints, etc. MONA analyses the automaton resulting from the compilation and prints out "valid" or a counter-example. MONA implements decision procedures for the Weak Second-order Theory of One or Two successors (WS1S/WS2S). The theory of one successor, known as WS1S, is a fragment of arithmetic augmented with second-order quantification over finite sets of natural numbers. Its first-order terms denote just natural numbers. The theory has no addition, since that would make it undecidable, but it has a unary operation +1, known as the successor function. WS2S is a generalization to tree structures. Since the theories are monadic second-order logics, we call our tool MONA. | ||
| + | |Homepage URL=http://www.brics.dk/mona/ | ||
|User level=intermediate | |User level=intermediate | ||
| − | |||
| − | |||
| − | |||
| − | |||
|Computer languages=C | |Computer languages=C | ||
|Documentation note=http://www.brics.dk/mona/mona14.pdf | |Documentation note=http://www.brics.dk/mona/mona14.pdf | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Keywords=translation,automata,mathematics,C,parse,formulas | |Keywords=translation,automata,mathematics,C,parse,formulas | ||
| − | | | + | |Version identifier=1.4-17 |
| − | |Last review by= | + | |Version date=2016/03/25 |
| − | |Last review date= | + | |Version status=stable |
| + | |Version download=http://www.brics.dk/mona/download/mona-1.4-17.tar.gz | ||
| + | |Last review by=Alejandroindependiente | ||
| + | |Last review date=2017/03/01 | ||
|Submitted by=Database conversion | |Submitted by=Database conversion | ||
|Submitted date=2011-04-01 | |Submitted date=2011-04-01 | ||
| − | | | + | |Status= |
| − | | | + | |Is GNU=No |
| − | | | + | |License verified date=2009-01-29 |
| − | | | + | }} |
| + | {{Project license | ||
| + | |License=GPLv2 | ||
| + | |License verified by=Kelly Hopkins | ||
| + | |License verified date=2009-01-29 | ||
| + | }} | ||
| + | {{Project license | ||
| + | |License=X11 | ||
| + | |License verified by=Kelly Hopkins | ||
|License verified date=2009-01-29 | |License verified date=2009-01-29 | ||
| − | |||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Anders Moeller | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=amoeller@brics.dk | |Email=amoeller@brics.dk | ||
|Resource URL= | |Resource URL= | ||
}} | }} | ||
{{Person | {{Person | ||
| + | |Real name=Nils Klarlund | ||
|Role=Maintainer | |Role=Maintainer | ||
| − | |||
|Email=klarlund@research.att.com | |Email=klarlund@research.att.com | ||
|Resource URL= | |Resource URL= | ||
| Line 56: | Line 58: | ||
}} | }} | ||
{{Software category | {{Software category | ||
| − | |Interface=command-line,x-window-system | + | |Interface=command-line, x-window-system |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
}} | }} | ||
| + | {{Featured}} | ||
Latest revision as of 11:34, 1 March 2017
MONA
http://www.brics.dk/mona/
a tool that translates formulas to finite-state automata.
MONA is a tool that translates formulas to finite-state automata. The formulas may express search patterns, temporal properties of reactive systems, parse tree constraints, etc. MONA analyses the automaton resulting from the compilation and prints out "valid" or a counter-example. MONA implements decision procedures for the Weak Second-order Theory of One or Two successors (WS1S/WS2S). The theory of one successor, known as WS1S, is a fragment of arithmetic augmented with second-order quantification over finite sets of natural numbers. Its first-order terms denote just natural numbers. The theory has no addition, since that would make it undecidable, but it has a unary operation +1, known as the successor function. WS2S is a generalization to tree structures. Since the theories are monadic second-order logics, we call our tool MONA.
Licensing
License
Verified by
Verified on
Notes
Leaders and contributors
| Contact(s) | Role |
|---|---|
| Anders Moeller | Maintainer |
| Nils Klarlund | Maintainer |
Resources and communication
| Audience | Resource type | URI |
|---|---|---|
| General | Download | http://www.brics.dk/mona/publications.html |
| Developer | Download | http://www.brics.dk/cgi-amoeller/mona/download |
| Developer | Changelog | http://www.brics.dk/mona/ChangeLog |
Software prerequisites
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the page “GNU Free Documentation License”.
The copyright and license notices on this page only apply to the text on this page. Any software or copyright-licenses or other similar notices described in this text has its own copyright notice and license, which can usually be found in the distribution or license text itself.