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 polyhedra-based 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.
Cite
CITATION STYLE
Shiple, T. R., Kukula, J. H., & Ranjan, R. K. (1998). A comparison of presburger engines for EFSM reachability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1427 LNCS, pp. 280–292). Springer Verlag. https://doi.org/10.1007/bfb0028752
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
