Maximizing entropy over Markov processes

DOI10.1016/J.JLAMP.2014.05.001MaRDI QIDQ465487zbMATHOpenAlexFDO

Authors Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Andrzej Wąsowski

Publication date 23 October 2014

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2014.05.001

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)

Recommendations

• Maximizing entropy over Markov processes
• On the complexity of computing maximum entropy for Markovian models
• On the computation of covert channel capacity
• Information flow in interactive systems
• Quantifying information leakage of randomized protocols

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• A Mathematical Theory of Communication
• Abstract non-interference
• Abstract probabilistic automata
• An abstract interpretation-based model for safety semantics
• Anonymity protocols as noisy channels
• Assessing security threats of looping constructs
• CONCUR 2005 – Concurrency Theory
• Constraint Markov chains
• Depth-First Search and Linear Graph Algorithms
• Elements of Information Theory
• Entropy maximization for Markov and semi-Markov processes
• Information Theory and Statistical Mechanics
• Interval-valued finite Markov chains
• Model-Checking ω-Regular Properties of Interval Markov Chains
• On the Foundations of Quantitative Information Flow
• Quantifying information leakage of randomized protocols
• Quantitative Information Flow, Relations and Polymorphic Types
• Temporal logics for the specification of performance and reliability

Cited in

(13)

• Entropy Maximization for Partially Observable Markov Decision Processes
• scientific article; zbMATH DE number 6117344 (Why is no real title available?)
• Detection-averse optimal and receding-horizon control for Markov decision processes
• Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
• Moving average processes and maximum entropy
• scientific article; zbMATH DE number 4180411 (Why is no real title available?)
• Opacity for linear constraint Markov chains
• scientific article; zbMATH DE number 48468 (Why is no real title available?)
• An automated quantitative information flow analysis for concurrent programs
• Quantifying information leakage of randomized protocols
• Maximizing entropy over Markov processes
• On the complexity of computing maximum entropy for Markovian models
• Design of biased random walks on a graph with application to collaborative recommendation

This page was built for publication: Maximizing entropy over Markov processes

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