10 citations · 44 across the 15 of their papers we have counts for
10 papers · 1 filter
Buffered control for opacity in timed automata
Étienne André, Sarah Dépernet, Engel Lefaucheux
Timed automata are an extension of finite automata that can measure and react to the passage of time, handling real-time constraints by using clocks. The timed opacity problem, whe…
Parametric disjunctive timed networks
Étienne André, Swen Jacobs, Engel Lefaucheux
We consider distributed systems with an arbitrary number of processes, modelled by timed automata that communicate through location guards: a process can take a guarded transition…
The Bright Side of Timed Opacity
Étienne André, Sarah Dépernet, Engel Lefaucheux
Timed automata (TAs) are an extension of finite automata that can measure and react to the passage of time, providing the ability to handle real-time constraints using clocks. In 2…
The 2-Dimensional Constraint Loop Problem is Decidable
Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine +1
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of…
Expiring opacity problems in parametric timed automata
Étienne André, Engel Lefaucheux, Dylan Marinho
Information leakage can have dramatic consequences on the security of real-time systems. Timing leaks occur when an attacker is able to infer private behavior depending on timing i…
Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata
Étienne André, Engel Lefaucheux, Didier Lime +2
Timing information leakage occurs whenever an attacker successfully deduces confidential internal information by observing some timed information such as events with timestamps. Ti…
Model Checking Linear Dynamical Systems under Floating-point Rounding
Engel Lefaucheux, Joël Ouaknine, David Purser +1
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 re…
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…
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…
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…