The pseudo-reachability problem for diagonalisable linear dynamical systems

The pseudo-reachability problem for diagonalisable linear dynamical systems

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 <i>o</i&g...

Volledige beschrijving

Bibliografische gegevens
Hoofdauteurs:	D'Costa, J, Karimov, T, Majumdar, R, Ouaknine, J, Salamati, M, Worrell, J
Formaat:	Conference item
Taal:	English
Gepubliceerd in:	Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2022

Gelijkaardige items

The pseudo-Skolem Problem is decidable
door: D'Costa, J, et al.
Gepubliceerd in: (2021)

Reachability and escape problems in linear dynamical systems
door: Dcosta, J
Gepubliceerd in: (2024)

On recurrent reachability for continuous linear dynamical systems
door: Ouaknine, J, et al.
Gepubliceerd in: (2016)

On recurrent reachability for continuous linear dynamical systems
door: Chonev, V, et al.
Gepubliceerd in: (2016)

On the complexity of the Escape Problem for linear dynamical systems over compact semialgebraic sets
door: D'Costa, J, et al.
Gepubliceerd in: (2021)

On the decidability of reachability in linear time-invariant systems
door: Fijalkow, N, et al.
Gepubliceerd in: (2019)

On LTL model-checking for low-dimensional discrete linear dynamical systems
door: Karimov, T, et al.
Gepubliceerd in: (2020)

Reachability problems for linear dynamical systems
door: Chonev, V
Gepubliceerd in: (2015)

On reachability problems for low-dimensional matrix semigroups
door: Colcombet, T, et al.
Gepubliceerd in: (2019)

On the Relationship between Reachability Problems in Timed and Counter Automata
door: Haase, C, et al.
Gepubliceerd in: (2012)

On the relationship between reachability problems in timed and counter automata
door: Haase, C, et al.
Gepubliceerd in: (2012)

Nonnegativity problems for matrix semigroups
door: D'Costa, J, et al.
Gepubliceerd in: (2024)

Bounding the escape time of a linear dynamical system over a compact semialgebraic set
door: D'Costa, J, et al.
Gepubliceerd in: (2022)

The Orbit Problem for parametric linear dynamical systems
door: Baier, C, et al.
Gepubliceerd in: (2021)

On the skolem problem for continuous linear dynamical systems
door: Chonev, V, et al.
Gepubliceerd in: (2016)

On the Skolem Problem for continuous linear dynamical systems
door: Ouaknine, J, et al.
Gepubliceerd in: (2016)

Reachability in Succinct and Parametric One−Counter Automata
door: Haase, C, et al.
Gepubliceerd in: (2009)

Reachability in Succinct and Parametric One-Counter Automata
door: Haase, C, et al.
Gepubliceerd in: (2009)

On the polytope escape problem for continuous linear dynamical systems
door: Ouaknine, J, et al.
Gepubliceerd in: (2017)

Asymptotic orders of reachability in linear dynamic systems
door: Özveren, Cüneyt M
Gepubliceerd in: (2005)

On reachability for hybrid automata over bounded time
door: Brihaye, T, et al.
Gepubliceerd in: (2011)

Deciding ω-regular properties on linear recurrence sequences
door: Almagor, S, et al.
Gepubliceerd in: (2021)

Decision Problems for Linear Recurrence Sequences.
door: Ouaknine, J, et al.
Gepubliceerd in: (2012)

Invariants for continuous linear dynamical systems
door: Kelmendi, E, et al.
Gepubliceerd in: (2020)

Algebraic model checking for discrete linear dynamical systems
door: Luca, F, et al.
Gepubliceerd in: (2022)

Revisiting reachability in timed automata
door: Quaas, K, et al.
Gepubliceerd in: (2017)

Algebraic invariants for linear hybrid automata
door: Majumdar, R, et al.
Gepubliceerd in: (2020)

How fast can you escape a compact polytope?
door: D'Costa, J, et al.
Gepubliceerd in: (2020)

On affine reachability problems
door: Jaax, S, et al.
Gepubliceerd in: (2020)

What's decidable about linear loops?
door: Karimov, T, et al.
Gepubliceerd in: (2022)

Asymptotic orders of reachability in perturbed linear systems
Gepubliceerd in: (2003)

Asymptotic orders of reachability in perturbed linear systems
Gepubliceerd in: (2003)

Robust online motion planning with reachable sets
door: Majumdar, Anirudha
Gepubliceerd in: (2013)

Reachability and robust design in dynamic systems
door: Harwood, Stuart Maxwell
Gepubliceerd in: (2016)

Porous invariants for linear systems
door: Lefaucheux, E, et al.
Gepubliceerd in: (2024)

Parameter synthesis for parametric probabilistic dynamical systems and prefix-independent specifications
door: Baier, C, et al.
Gepubliceerd in: (2022)

Reachability problems in nondeterministic polynomial maps on the integers
door: Ko, SK, et al.
Gepubliceerd in: (2018)

The reachability problem for two-dimensional vector addition systems with states
door: Blondin, M, et al.
Gepubliceerd in: (2021)

On the decidability of Presburger arithmetic expanded with powers
door: Karimov, T, et al.
Gepubliceerd in: (2025)

The Power of Positivity
door: Karimov, T, et al.
Gepubliceerd in: (2023)