A classification of time and/or probability dependent security properties

DOI10.1016/J.ENTCS.2005.10.038MaRDI QIDQ7014288zbMATH OpenFDO

Authors Ruggero Lanotte, Andrea Maggiolo-Schettini, Angelo Troina

Publication date 11 March 2025

Full work available at URL https://doi.org/10.1016/J.ENTCS.2005.10.038

zbMATH Keywords

covert channelsinformation flownon-interferenceprobabilistic timed automata

Mathematics Subject Classification ID

Computer security (68M25) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A theory of timed automata
• Automatic verification of real-time systems with discrete probability distributions.
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 2064461 (Why is no real title available?)
• scientific article; zbMATH DE number 3060775 (Why is no real title available?)
• On probabilistic timed automata.
• Weak bisimulation for probabilistic timed automata

Cited in

(1)

• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: A classification of time and/or probability dependent security properties

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