2 papers
cs.LO2026
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…
cs.LO2024
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…