Complete semialgebraic invariant synthesis for the Kannan-Lipton orbit problem
The Orbit Problem consists of determining, given a matrix A on Qd, 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 prob...
Hlavní autoři: | , , , , |
---|---|
Médium: | Journal article |
Vydáno: |
Springer Nature
2019
|