We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point representation after each step (i.e., stored as a fixed-precision mantissa and an exponent). The approach more faithfully models realistic implementations of linear loops, compared to the exact arbitrary-precision setting often employed in the study of linear dynamical systems
The object of this thesis is the study of the decidability properties of linear dynamical systems, w...
Linear hybrid systems are dynamical systems whose variables change both discretely and continuously ...
Consider a discrete dynamical system given by a square matrix M ∈ ℚ^{d × d} and a starting point s ∈...
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is re...
International audienceWe consider the MSO model-checking problem for simple linear loops, or equival...
We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, and...
We consider the MSO model-checking problem for simple linear loops, or equivalently discrete-time li...
We consider the problem of verifying finite precision implementation of linear time-invariant contro...
Termination analysis of linear loops plays a key rôle in several areas of computer science, includin...
International audienceThis paper analyzes the computational power of dynamical systems robust to inf...
Probabilistic model checking computes probabilities and expected values related to designated behavi...
The Reliable Computing journal has no more paper publication, only free, electronic publication.Inte...
International audienceWe study the decidability status of model-checking freeze LTL over various sub...
Many problems in computer science and applied mathematics require rounding a vector ? of fractional ...
International audienceIn this paper we discuss the computational power of Lipschitz dynamical system...
The object of this thesis is the study of the decidability properties of linear dynamical systems, w...
Linear hybrid systems are dynamical systems whose variables change both discretely and continuously ...
Consider a discrete dynamical system given by a square matrix M ∈ ℚ^{d × d} and a starting point s ∈...
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is re...
International audienceWe consider the MSO model-checking problem for simple linear loops, or equival...
We survey the state of the art on the algorithmic analysis of discrete linear dynamical systems, and...
We consider the MSO model-checking problem for simple linear loops, or equivalently discrete-time li...
We consider the problem of verifying finite precision implementation of linear time-invariant contro...
Termination analysis of linear loops plays a key rôle in several areas of computer science, includin...
International audienceThis paper analyzes the computational power of dynamical systems robust to inf...
Probabilistic model checking computes probabilities and expected values related to designated behavi...
The Reliable Computing journal has no more paper publication, only free, electronic publication.Inte...
International audienceWe study the decidability status of model-checking freeze LTL over various sub...
Many problems in computer science and applied mathematics require rounding a vector ? of fractional ...
International audienceIn this paper we discuss the computational power of Lipschitz dynamical system...
The object of this thesis is the study of the decidability properties of linear dynamical systems, w...
Linear hybrid systems are dynamical systems whose variables change both discretely and continuously ...
Consider a discrete dynamical system given by a square matrix M ∈ ℚ^{d × d} and a starting point s ∈...