On the Skolem Problem for continuous linear dynamical systems

Conference item

The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems, such as linear hybrid automata and continuous- time Markov chains. Decidability of the problem is currently open—indeed decidability is open even for the sub-problem in which a zero is sought in a bounded interval. In this paper we show decidability of the bounded problem subject to Schanuel’s Conjecture, a unifying conjecture in transcendental number theory. We furthermore analyse the unbounded problem in terms of the frequencies of the differential equation, that is, the imaginary parts of the characteristic roots. We show that the unbounded problem can be reduced to the bounded problem if there is at most one rationally linearly independent frequency, or if there are two rationally linearly independent frequencies and all characteristic roots are simple. We complete the picture by showing that de- cidability of the unbounded problem in the case of two (or more) rationally linearly independent frequencies would entail a major new effectiveness result in Diophantine approximation, namely computability of the Diophantine-approximation types of all real algebraic numbers

Authors: Ouaknine, J; Worrell, J; Chonev, V

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
• Host title: ICALP 2016 (43rd International Colloquium on Automata, Languages and Programming)
• Journal: LIPIcs
• Volume: Leibniz International Proceedings in Informatics
• Article number: 100
• Publication date: 2016-07-01
• Acceptance date: 2016-04-15
• DOI: 10.4230/LIPIcs.ICALP.2016.100
• EISSN: 1868-8969
• Keywords: F.2.1 Numerical Algorithms and Problems; semi-algebraic sets; reachability; differential equations; Baker’s Theorem,; Schanuel’s Conjecture; F.1.1 Models of Computation