Reachability in dynamical systems with rounding

DOI10.4230/LIPICS.FSTTCS.2020.36MaRDI QIDQ6839866zbMATH OpenFDO

Authors Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2020.36

zbMATH Keywords

dynamical systemsreachabilityrounding

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• Approximating Continuous Systems by Timed Automata
• Asymptotic Independence and Uniform Distribution of Quantization Errors for Spatially Discretized Dynamical Systems
• Certified roundoff error bounds using semidefinite programming
• COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
• Discretization of Continuous Dynamical Systems Using UPPAAL
• Discretized rotation has infinitely many periodic orbits
• Dynamically-driven timed automaton abstractions for proving liveness of continuous systems
• Effects of phase space discretization on the long-time behavior of dynamical systems
• Ergodic properties of a method of numerical simulation of chaotic dynamical systems
• Generalized radix representations and dynamical systems. I
• scientific article; zbMATH DE number 3117635 (Why is no real title available?)
• scientific article; zbMATH DE number 1014071 (Why is no real title available?)
• scientific article; zbMATH DE number 776267 (Why is no real title available?)
• scientific article; zbMATH DE number 7559115 (Why is no real title available?)
• Is every approximate trajectory of some process near an exact trajectory of a nearby process?
• Numerical orbits of chaotic processes represent true orbits
• Pathologies generated by round-off in dynamical systems
• Polynomial-time algorithm for the orbit problem
• PSEUDO-RANDOMNESS OF ROUND-OFF ERRORS IN DISCRETIZED LINEAR MAPS ON THE PLANE
• Quasi-periodicity, global stability and scaling in a model of Hamiltonian round-off
• Reachability problems for Markov chains
• Rigorous estimation of floating-point round-off errors with symbolic Taylor expansions
• Round-off errors andp-adic numbers
• Set-valued Markov chains and negative semitrajectories of discretized dynamical systems
• Small perturbations of chaotic dynamical systems
• Static analysis of finite precision computations
• The Arithmetic of Discretized Rotations
• The finiteness property for shift radix systems with general parameters
• The polyhedron-hitting problem

Cited in

(2)

• Robust positivity problems for linear recurrence sequences: the frontiers of decidability for explicitly given neighbourhoods
• Deciding robust instances of an escape problem for dynamical systems in Euclidean space

This page was built for publication: Reachability in dynamical systems with rounding

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