Probabilistic disclosure: maximisation vs. minimisation
From MaRDI portal
Publication:5136302
Recommendations
Cites work
- scientific article; zbMATH DE number 5595162 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- Current-State Opacity Formulations in Probabilistic Finite Automata
- Model-Checking ω-Regular Properties of Interval Markov Chains
- On the power of imperfect information
- Probabilistic automata on finite words: decidable and undecidable problems
- Probabilistic opacity for Markov decision processes
- Qualitative analysis of partially-observable Markov decision processes
- Quantifying opacity
- Random Measurable Selections
- Randomness for free
- The Complexity of Markov Decision Processes
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(4)
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)