psolve: Deciding satisfiability for presburger formulae using automata, rewriting and a model checker

Presburger formulas are an expressive but decidable language of arithmetic expressions and boolaen connectives with quantification. psolve is a prototype of an automata based tool for deciding the satisfiability of Presburger formulae extended with a predicate that recognizes powers of two. The unique features of psolve are the use of model checkers to examine the automata, the use of concurrent automata and the inclusion of the powers of two predicate. psolve was used to compare the time requirements for implicit and explicit state ennumeration model checkers as the automata animation tools On our simple examples, we found that implicit stat ennumeration model checkers require less time. psolve will eventualy be used in a type system for a hardware description language which uses Presburger formulae as a type language.