Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem - Archive ouverte HAL Access content directly
Journal Articles Theory of Computing Systems Year : 2019

Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem

Abstract

The Orbit Problem consists of determining, given a matrix A on 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 ⊆ R d , i.e., sets that are stable under A and contain x but not y, thereby providing compact and versatile certificates of non-reachability. We show that whether a given instance of the Orbit Problem admits a semialge-braic invariant is decidable, and moreover in positive instances we provide an algorithm to synthesise suitable succinct invariants of polynomial size. Fijalkow et al Our results imply that the class of closed semialgebraic invariants is closure-complete: there exists a closed semialgebraic invariant if and only if y is not in the topological closure of the orbit of x under A.
Fichier principal
Vignette du fichier
ToCS_SemiAlgebraicInvariants.pdf (353.09 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02503357 , version 1 (18-11-2020)

Identifiers

Cite

Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell. Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory of Computing Systems, 2019, 63 (5), pp.1027-1048. ⟨10.1007/s00224-019-09913-3⟩. ⟨hal-02503357⟩
79 View
94 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More