Maximizing entropy over Markov processes

DOI10.1016/J.JLAMP.2014.05.001zbMATH Open1371.68175OpenAlexW1998783985MaRDI QIDQ465487FDOQ465487

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

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

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)

Cites Work

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

Cited In (13)

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

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)