8 search results - page 1 / 2 » On the Use of Non-deterministic Automata for Presburger Arit... |
CONCUR
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. A well-known decision procedure for Presburger arithmetic uses deterministic finite-state automata. While the complexity of the decision procedure for Presburger arithme...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
TAPAS is a suite of libraries dedicated to FO (R, Z, +, ≤). The suite provides (1) the application programming interface GENEPI for this logic with encapsulations of many classic...
WIA
2004
Springer
13 years 10 months ago
2004
Springer
In this paper we propose a new data structure, called shared automata, for representing deterministic finite automata (DFA). Shared automata admit a strong canonical form for DFA ...
AAAI
2008
13 years 6 months ago
2008
This paper proposes an optimal approach to infinite-state action planning exploiting automata theory. State sets and actions are characterized by Presburger formulas and represent...