7 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…
Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
Ãtienne André, Didier Lime, Olivier H. Roux
Ensuring the correctness of critical real-time systems, involving concurrent behaviours and timing requirements, is crucial. Timed automata extend finite-state automata with clocks…
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…
Opacity problems in multi-energy timed automata
Ãtienne André, Lydia Bakiri
Cyber-physical systems can be subject to information leakage; in the presence of continuous variables such as time and energy, these leaks can be subtle to detect. We study here th…
Parameterized Verification of Timed Networks with Clock Invariants
Ãtienne André, Swen Jacobs, Shyam Lal Karra +1
We consider parameterized verification problems for networks of timed automata (TAs) based on different communication primitives. To this end, we first consider disjunctive timed n…