Probabilistic opacity for Markov decision processes

DOI10.1016/j.ipl.2014.09.001zbMath1366.68213arXiv1407.4225OpenAlexW2090930915MaRDI QIDQ458386

Béatrice Bérard, Nathalie Sznajder, Krishnendu Chatterjee

Publication date: 7 October 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.4225

zbMATH Keywords

Markov decision processesdecidabilityformal methodsopacityperfect and partial informationsecurity properties

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Markov and semi-Markov decision processes (90C40) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (8)

The complexity of synchronous notions of information flow security ⋮ Accurate approximate diagnosis of (controllable) stochastic systems ⋮ A new approach for the verification of infinite-step and \(K\)-step opacity using two-way observers ⋮ Information control in networked discrete event systems and its application to battery management systems ⋮ Infinite-step opacity and \(K\)-step opacity of stochastic discrete-event systems ⋮ Opacity for linear constraint Markov chains ⋮ Enforcement of opacity by public and private insertion functions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Synthesis of opaque systems with static and dynamic masks
• Alternating finite automata on \(\omega\)-words
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
• Current-State Opacity Formulations in Probabilistic Finite Automata
• Asymptotic Information Leakage under One-Try Attacks
• Randomness for Free
• Qualitative Analysis of Partially-Observable Markov Decision Processes
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• The complexity of probabilistic verification
• Supervisory Control for Opacity
• Time-Bounded Reachability for Monotonic Hybrid Automata: Complexity and Fixed Points
• Verification of Infinite-Step Opacity and Complexity Considerations
• Probabilistic ω-automata
• Algorithms for Omega-Regular Games with Imperfect Information
• Probabilistic automata
• Quantifying opacity

This page was built for publication: Probabilistic opacity for Markov decision processes