5 papers
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…
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…
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…
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…
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…