The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

04/26/2022
by   Julian D'Costa, et al.
0

We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical reachability. Using an approach based on o-minimality of _exp we prove decidability of the discrete-time pseudo-reachability problem with arbitrary semialgebraic targets for diagonalisable linear dynamical systems. We also show that our method can be used to reduce the continuous-time pseudo-reachability problem to the (classical) time-bounded reachability problem, which is known to be conditionally decidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2022

What's Decidable about Discrete Linear Dynamical Systems?

We survey the state of the art on the algorithmic analysis of discrete l...
research
09/28/2020

Reachability in Dynamical Systems with Rounding

We consider reachability in dynamical systems with discrete linear updat...
research
01/30/2023

Measuring robustness of dynamical systems. Relating time and space to length and precision

Verification of discrete time or continuous time dynamical systems over ...
research
09/17/2023

Data-Driven Reachability Analysis of Stochastic Dynamical Systems with Conformal Inference

We consider data-driven reachability analysis of discrete-time stochasti...
research
02/15/2021

Model-bounded monitoring of hybrid systems

Monitoring of hybrid systems attracts both scientific and practical atte...
research
04/21/2021

The Orbit Problem for Parametric Linear Dynamical Systems

We study a parametric version of the Kannan-Lipton Orbit Problem for lin...
research
01/30/2019

The Semialgebraic Orbit Problem

The Semialgebraic Orbit Problem is a fundamental reachability question t...

Please sign up or login with your details

Forgot password? Click here to reset