10 citations · 44 across the 15 of their papers we have counts for
5 papers · 1 filter
Execution-time opacity problems in one-clock parametric timed automata
Étienne André, Johan Arcile, Engel Lefaucheux
Parametric timed automata (PTAs) extend the concept of timed automata, by allowing timing delays not only specified by concrete values but also by parameters, allowing the analysis…
Execution-time opacity control for timed automata
Étienne André, Marie Duflot, Laetitia Laversa +1
Timing leaks in timed automata (TA) can occur whenever an attacker is able to deduce a secret by observing some timed behaviour. In execution-time opacity, the attacker aims at ded…
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…