Maximizing entropy over Markov processes

DOI10.1016/j.jlamp.2014.05.001zbMath1371.68175OpenAlexW1998783985MaRDI QIDQ465487

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

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

Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (5)

Design of biased random walks on a graph with application to collaborative recommendation ⋮ An automated quantitative information flow analysis for concurrent programs ⋮ Detection-averse optimal and receding-horizon control for Markov decision processes ⋮ Opacity for linear constraint Markov chains ⋮ Quantifying information leakage of randomized protocols

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Constraint Markov chains
• Entropy maximization for Markov and semi-Markov processes
• Interval-valued finite Markov chains
• Anonymity protocols as noisy channels
• Quantifying Information Leakage of Randomized Protocols
• An abstract interpretation-based model for safety semantics
• Quantitative Information Flow, Relations and Polymorphic Types
• Abstract Probabilistic Automata
• Assessing security threats of looping constructs
• Information Theory and Statistical Mechanics
• Abstract non-interference
• On the Foundations of Quantitative Information Flow
• Temporal logics for the specification of performance and reliability
• Model-Checking ω-Regular Properties of Interval Markov Chains
• Elements of Information Theory
• Depth-First Search and Linear Graph Algorithms
• CONCUR 2005 – Concurrency Theory

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