@inproceedings{df267a5913ca473a9ca63f513aac7754,
title = "Left-eigenvectors are certificates of the orbit problem",
abstract = "This paper investigates the connection between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial certificates of non-reachability for the Orbit Problem for linear transformations with coefficients in (formula presented) to the generalized eigenvector problem. Also, we prove the existence of such certificates for any transformation with integer coefficients, which is not the case with rational coefficients.",
author = "\{de Oliveira\}, Steven and Virgile Prevosto and Peter Habermehl and Saddek Bensalem",
note = "Publisher Copyright: {\textcopyright} 2018, Springer Nature Switzerland AG.; 12th International Conference on Reachability Problems, RP 2018 ; Conference date: 24-09-2018 Through 26-09-2018",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-00250-3\_3",
language = "English",
isbn = "9783030002497",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "30--44",
editor = "Igor Potapov and Pierre-Alain Reynier",
booktitle = "Reachability Problems - 12th International Conference, RP 2018, Proceedings",
}