On the Skolem problem for continuous linear dynamical systems

DOI10.4230/LIPICS.ICALP.2016.100MaRDI QIDQ4598241zbMATH OpenFDO

Authors Ventsislav Chonev, Joël Ouaknine, James Worrell

Publication date 19 December 2017

Full work available at URL https://arxiv.org/abs/1506.00695

zbMATH Keywords

Baker's theoremdifferential equationsreachabilitySchanuel's conjecturesemi-algebraic sets

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Semialgebraic sets and related spaces (14P10) Linear ordinary differential equations and systems (34A30)

Recommendations

• The continuous Skolem-Pisot problem
• Complexity of Restricted Variants of Skolem and Related Problems
• On recurrent reachability for continuous linear dynamical systems
• Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
• Reachability in Linear Dynamical Systems

Cited in

(26)

• On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
• Exact solutions in log-concave maximum likelihood estimation
• Positive root isolation for poly-powers by exclusion and differentiation
• Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
• Reachability in Linear Dynamical Systems
• On recurrent reachability for continuous linear dynamical systems
• A Survey on Analog Models of Computation
• The big-O problem for labelled Markov chains and weighted automata
• On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
• The big-O problem
• Complexity of Restricted Variants of Skolem and Related Problems
• What's decidable about discrete linear dynamical systems?
• The computability of LQR and LQG control
• On the decidability of reachability in continuous time linear time-invariant systems
• A probabilistic logic for verifying continuous-time Markov chains
• Positivity-hardness results on Markov decision processes
• Reachability analysis of linear systems
• On the complexity of robust eventual inequality testing for C-finite functions
• Square-free factorization of mixed trigonometric-polynomials
• On Skolem-hardness and saturation points in Markov decision processes
• On decidability of time-bounded reachability in CTMDPs
• Invariants for continuous linear dynamical systems
• Checking continuous stochastic logic against quantum continuous-time Markov chains
• Axiomatization of compact initial value problems: open properties
• Reduction of transcendental decision problems over the reals
• The continuous Skolem-Pisot problem

This page was built for publication: On the Skolem problem for continuous linear dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598241)