Abstract
We present a practical algorithm for computing least solutions of systems of equations over the integers with addition, multiplication with positive constants, maximum and minimum. The algorithm is based on strategy iteration. Its run-time (w.r.t. the uniform cost measure) is independent of the sizes of occurring numbers. We apply our technique to solve systems of interval equations. In particular, we show how arbitrary intersections as well as full interval multiplication in interval equations can be dealt with precisely. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Gawlitza, T., & Seidl, H. (2007). Precise fixpoint computation through strategy iteration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4421 LNCS, pp. 300–315). Springer Verlag. https://doi.org/10.1007/978-3-540-71316-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
