Probabilistic disclosure: maximisation vs. minimisation

DOI10.4230/LIPICS.FSTTCS.2017.13zbMATH Open1491.68106MaRDI QIDQ5136302FDOQ5136302

Authors: Béatrice Bérard, Serge Haddad, Engel Lefaucheux 

Publication date: 25 November 2020

Recommendations

• Probabilistic opacity for Markov decision processes
• Quantifying opacity
• Probabilistic system opacity in discrete event systems
• Opacity for linear constraint Markov chains
• Comparing the notions of opacity for discrete-event systems

zbMATH Keywords

Markov chainMarkov decision processopacitypartially observed systems

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Markov and semi-Markov decision processes (90C40) Computer security (68M25)

Cites Work

• Title not available (Why is that?)
• The Complexity of Markov Decision Processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Randomness for free
• Qualitative analysis of partially-observable Markov decision processes
• Probabilistic automata on finite words: decidable and undecidable problems
• Probabilistic opacity for Markov decision processes
• On the power of imperfect information
• Model-Checking ω-Regular Properties of Interval Markov Chains
• Tools and Algorithms for the Construction and Analysis of Systems
• Current-State Opacity Formulations in Probabilistic Finite Automata
• Quantifying opacity
• Title not available (Why is that?)
• Random Measurable Selections

Cited In (3)

• Accurate approximate diagnosis of (controllable) stochastic systems
• Financial Cryptography and Data Security
• Information control in networked discrete event systems and its application to battery management systems

This page was built for publication: Probabilistic disclosure: maximisation vs. minimisation

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