The bright side of timed opacity

DOI10.46298/LMCS-22(2:31)2026MaRDI QIDQ7308611zbMATH OpenFDO

Authors Étienne André, Sarah Dépernet, Engel Lefaucheux

Publication date 4 August 2026

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46298/LMCS-22(2:31)2026

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• A theory of timed automata
• Bounded determinization of timed automata with silent transitions
• CONCUR 2004 - Concurrency Theory
• Control and synthesis of non-interferent timed systems
• Decidability of the initial-state opacity of real-time automata
• Event-clock automata: a determinizable class of timed automata
• Execution-time opacity problems in one-clock parametric timed automata
• scientific article; zbMATH DE number 1799514 (Why is no real title available?)
• scientific article; zbMATH DE number 2064461 (Why is no real title available?)
• scientific article; zbMATH DE number 1530301 (Why is no real title available?)
• Non-interference control synthesis for security timed automata
• Parametric real-time reasoning
• Reachability in two-clock timed automata is PSPACE-complete
• Real-time automata
• Secure integrated circuits and systems
• State-based opacity of labeled real-time automata
• Timed non-interference under partial observability and bounded memory
• Universality analysis for one-clock timed automata

This page was built for publication: The bright side of timed opacity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7308611)