AI Chat AI Image Generator AI Video Text to Speech

What's Decidable about Discrete Linear Dynamical Systems?

06/22/2022

∙

by Toghrul Karimov, et al.

∙

∙

We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, focussing in particular on reachability, model-checking, and invariant-generation questions, both unconditionally as well as relative to oracles for the Skolem Problem.

Toghrul Karimov
5 publications
Edon Kelmendi
7 publications
Joël Ouaknine
29 publications
James Worrell
37 publications

page 1

page 2

page 3

page 4

research

∙ 07/06/2020

On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems

Consider a discrete dynamical system given by a square matrix M ∈ℚ^d × d...

0 Toghrul Karimov, et al. ∙

research

∙ 04/26/2022

The Pseudo-Reachability Problem for Diagonalisable Linear Dynamical Systems

We study fundamental reachability problems on pseudo-orbits of linear dy...

0 Julian D'Costa, et al. ∙

research

∙ 11/08/2022

Model Checking Linear Dynamical Systems under Floating-point Rounding

We consider linear dynamical systems under floating-point rounding. In t...

0 Engel Lefaucheux, et al. ∙

research

∙ 07/17/2020

PAC Model Checking of Black-Box Continuous-Time Dynamical Systems

In this paper we present a novel model checking approach to finite-time ...

0 Bai Xue, et al. ∙

research

∙ 10/21/2019

How to lose at Monte Carlo: a simple dynamical system whose typical statistical behavior is non computable

We consider the simplest non-linear discrete dynamical systems, given by...

0 Cristobal Rojas, et al. ∙

research

∙ 09/19/2023

Hamilton-Jacobi Reachability Analysis for Hybrid Systems with Controlled and Forced Transitions

Hybrid dynamical systems with non-linear dynamics are one of the most ge...

0 Javier Borquez, et al. ∙

research

∙ 05/08/2020

Dynamical Systems Theory and Algorithms for NP-hard Problems

This article surveys the burgeoning area at the intersection of dynamica...

0 Tuhin Sahai, et al. ∙