Continuous linear dynamical systems are used extensively in mathematics, computer science, physics, and engineering to model the evolution of a system over time. A central technique for certifying safety properties of such systems is by synthesising inductive invariants. This is the task of finding a set of states that is closed under the dynamics of the system and is disjoint from a given set of error states. In this paper we study the problem of synthesising inductive invariants that are definable in o-minimal expansions of the ordered field of real numbers. In particular, assuming Schanuel’s conjecture in transcendental number theory, we establish effective synthesis of o-minimal invariants in the case of semi-algebraic error sets. Witho...
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential e...
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
The set of initial conditions for which the pseudoclassical evolution algorithm (and minimality cons...
Termination analysis of linear loops plays a key rôle in several areas of computer science, includin...
The Orbit Problem consists of determining, given a linear transformation A on Qd, together with vect...
International audienceIn this paper, we show that a basic fixed point method used to enclose the gre...
The Orbit Problem consists of determining, given a linear transformation A on Qd , together with vec...
The Orbit Problem consists of determining, given a linear transformation A on d-dimensional rational...
The termination analysis of linear loops plays a key rôle in several areas of computer science, incl...
We define the notion of inductive invariants for continuous dynamical systems and use it to pres...
We are interested in automatically proving safety properties of infinite state systems. We present a...
International audienceThe Orbit Problem consists of determining, given a matrix A on Q d , together ...
The Orbit Problem consists of determining, given a matrix A on Qd, together with vectors x and y, wh...
© The Author(s) 2019. We formulate numerically-robust inductive proof rules for unbounded stability ...
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential e...
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential e...
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
The set of initial conditions for which the pseudoclassical evolution algorithm (and minimality cons...
Termination analysis of linear loops plays a key rôle in several areas of computer science, includin...
The Orbit Problem consists of determining, given a linear transformation A on Qd, together with vect...
International audienceIn this paper, we show that a basic fixed point method used to enclose the gre...
The Orbit Problem consists of determining, given a linear transformation A on Qd , together with vec...
The Orbit Problem consists of determining, given a linear transformation A on d-dimensional rational...
The termination analysis of linear loops plays a key rôle in several areas of computer science, incl...
We define the notion of inductive invariants for continuous dynamical systems and use it to pres...
We are interested in automatically proving safety properties of infinite state systems. We present a...
International audienceThe Orbit Problem consists of determining, given a matrix A on Q d , together ...
The Orbit Problem consists of determining, given a matrix A on Qd, together with vectors x and y, wh...
© The Author(s) 2019. We formulate numerically-robust inductive proof rules for unbounded stability ...
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential e...
The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential e...
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
The set of initial conditions for which the pseudoclassical evolution algorithm (and minimality cons...