Termination of Integer Linear Programs
We show that termination of a simple class of linear loops over the integers is decidable. Namely we show that termination of deterministic linear loops is decidable over the integers in the homogeneous case, and over the rationals in the general case. This is done by analyzing the powers of a matrix symbolically using its eigenvalues. Our results generalize the work of Tiwari [Tiw04], where similar results were derived for termination over the reals. We also gain some insights into termination of non-homogeneous integer programs, that are very common in practice.
KeywordsRational Point Integer Linear Program Convex Cone Algebraic Number Homogeneous Case
Unable to display preview. Download preview PDF.
- [Loos83]Loos, R.: Computing in Algebraic Extensions. In: Buchberger, B., Collins, G.E., et al. (eds.) Computer Algebra: Symbolic and Algebraic Computation, 2nd edn., pp. 173–188. Springer, Heidelberg (1983)Google Scholar
- [Mat93]Matiyasevich, Y.: Hilbert’s Tenth Problem. The MIT Press, Cambridge (1993)Google Scholar