activity
20192022
most citedstrategFTO: Untimed control for timed opacity

6 citations · 7 across the 4 of their papers we have counts for

collaborators

9 papers

cs.CR20226 cited

strategFTO: Untimed control for timed opacity

Étienne André, Shapagat Bolat, Engel Lefaucheux +1

We introduce a prototype tool strategFTO addressing the verification of a security property in critical software. We consider a recent definition of timed opacity where an attacker…

cs.FL2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals

Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki +2

We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of…

cs.CC2021

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets

Julian D'Costa, Engel Lefaucheux, Eike Neumann +2

We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for…

cs.LO2021

Porous Invariants

Engel Lefaucheux, Joël Ouaknine, David Purser +1

We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in f…

cs.LO2021

The Orbit Problem for Parametric Linear Dynamical Systems

Christel Baier, Florian Funke, Simon Jantsch +7

We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical systems. We show decidability in the case of one parameter and Skolem-hardness with two or mor…

cs.CC20201 cited

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…