eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2017-03-06
29:1
29:13
10.4230/LIPIcs.STACS.2017.29
article
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
Fijalkow, Nathanaël
Ohlmann, Pierre
Ouaknine, Joël
Pouly, Amaury
Worrell, James
The Orbit Problem consists of determining, given a linear transformation A on d-dimensional rationals Q^d, together with vectors x and y, whether the orbit of x under repeated applications of A can ever reach y. This problem was famously shown to be decidable by Kannan and Lipton in the 1980s.
In this paper, we are concerned with the problem of synthesising suitable invariants P which are subsets of R^d, i.e., sets that are stable under A and contain x and not y, thereby providing compact and versatile certificates of non-reachability. We show that whether a given instance of the Orbit Problem admits a semialgebraic invariant is decidable, and moreover in positive instances we provide an algorithm to synthesise suitable invariants of polynomial size.
It is worth noting that the existence of semilinear invariants, on the other hand, is (to the best of our knowledge) not known to be decidable.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol066-stacs2017/LIPIcs.STACS.2017.29/LIPIcs.STACS.2017.29.pdf
Verification,algebraic computation,Skolem Problem,Orbit Problem,invariants