42 citations · 161 across the 23 of their papers we have counts for
3 papers · 1 filter
A Survey on Analog Models of Computation
Olivier Bournez, Amaury Pouly
We present a survey on analog models of computations. Analog can be understood both as computing by analogy, or as working on the continuum. We consider both approaches, often inte…
On the Decidability of Reachability in Linear Time-Invariant Systems
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly +2
We consider the decidability of state-to-state reachability in linear time-invariant control systems over discrete time. We analyse this problem with respect to the allowable contr…
Polynomial Invariants for Affine Programs
Ehud Hrushovski, Joël Ouaknine, Amaury Pouly +1
We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-determin…