5 search results - page 1 / 1 » Bounds on the automata size for Presburger arithmetic |
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...
TOCL
2008
13 years 4 months ago
2008
MEMOCODE
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we present a technique for determining tight bounds on the execution time of assembler programs. Thus, our method is independent of the design flow, but takes into...
TACAS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...