DMCA
A Comparison of Presburger Engines for EFSM Reachability (1998)
by
Thomas R. Shiple
,
James H. Kukula
,
Rajeev K. Ranjan
| Citations: | 31 - 0 self |
BibTeX
@MISC{Shiple98acomparison,
author = {Thomas R. Shiple and James H. Kukula and Rajeev K. Ranjan},
title = {A Comparison of Presburger Engines for EFSM Reachability},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Implicit state enumeration for extended finite state machines relies on a decision procedure for Presburger arithmetic. We compare the performance of two Presburger packages, the automata-based Shasta package and the polyhedrabased Omega package. While the raw speed of each of these two packages can be superior to the other by a factor of 50 or more, we found the asymptotic performance of Shasta to be equal or superior to that of Omega for the experiments we performed.
