2 papers
cs.LO2018
Left-eigenvectors are certificates of the Orbit Problem
Steven de Oliveira, Virgile Prevosto, Peter Habermehl +1
This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we re…
cs.LO2017
Model-checking Counting Temporal Logics on Flat Structures
Normann Decker, Peter Habermehl, Martin Leucker +2
We study several extensions of linear-time and computation-tree temporal logics with quantifiers that allow for counting how often certain properties hold. For most of these extens…