Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
نویسندگان
چکیده
منابع مشابه
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
The Orbit Problem consists of determining, given a linear transformation A on Q, 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, i.e., sets that are stable under A a...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولLeft-eigenvectors are certificates of the Orbit Problem
This paper investigates the connexion 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 Q to the generalized eigenvector problem. Also, we prove the ...
متن کاملThe Synthesis Problem for Elementary Net Systems is NP-Complete
The so-called synthesis problem consists in deciding for a class of nets whether a given graph is isomorphic to the case graph of some net and then constructing the net. This problem has been solved for various classes of nets, ranging from elementary nets to Petri nets. The general principle is to compute regions in the graph, i.e. subsets of nodes liable to represent extensions of places of a...
متن کاملSolving the Rural Postman problem using the Adleman-Lipton model
In this survey we investigate the application of the Adleman-Lipton model on Rural Postman problem, which given an undirected graph G = (V,E) with positive integer lengths on each of its edges and a subset E ′ ⊆ E, asks whether there exists a hamiltonian circuit that includes each edge of E ′ and has total cost (sum of edge lengths) less or equal to a given integer B (we are allowed to use any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2019
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-019-09913-3