1 citations · 1 across the 2 of their papers we have counts for
7 papers
The Membership Problem for Hypergeometric Sequences with Rational Parameters
Klara Nosan, Amaury Pouly, Mahsa Shirmohammadi +1
We investigate the Membership Problem for hypergeometric sequences: given a hypergeometric sequence of rational numbers and a target $t \in \math…
Reachability in Dynamical Systems with Rounding
Christel Baier, Florian Funke, Simon Jantsch +6
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a…
On the Decidability of Reachability in Continuous Time Linear Time-Invariant Systems
Mohan Dantam, Amaury Pouly
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable con…
On the Monniaux Problem in Abstract Interpretation
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann +3
The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program , a safety (\emph{e.g.}, non-reachability) s…
Algebraic Invariants for Linear Hybrid Automata
Rupak Majumdar, Joël Ouaknine, Amaury Pouly +1
We exhibit an algorithm to compute the strongest algebraic (or polynomial) invariants that hold at each location of a given unguarded linear hybrid automaton (i.e., a hybrid automa…
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…