The pseudo-reachability problem for diagonalisable linear dynamical systems

DOI10.4230/LIPICS.MFCS.2022.40MaRDI QIDQ6584037zbMATH OpenFDO

Authors Julian D'Costa, Toghrul Karimov, Rupak Majumdar, Joël Ouaknine, James Worrell

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.40

zbMATH Keywords

linear dynamical systemsorbit problempseudo-orbitsreachabilitySkolem problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(7)

• Model checking linear dynamical systems under floating-point rounding
• On robustness for the Skolem, positivity and ultimate positivity problems
• Linear dynamical systems with weight functions
• Axiomatization of compact initial value problems: open properties
• Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods
• Linear dynamical systems with continuous weight functions
• On expansions of monadic second-order logic with dynamical predicates

This page was built for publication: The pseudo-reachability problem for diagonalisable linear dynamical systems

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