A Demonic Approach to Information in Probabilistic Systems

DOI10.1007/978-3-642-04081-8_20zbMath1254.68167OpenAlexW1498847683MaRDI QIDQ3184680

François Laviolette, Josée Desharnais, Amélie Turgeon

Publication date: 22 October 2009

Published in: CONCUR 2009 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04081-8_20

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Coalgebraic logic over general measurable spaces – a survey ⋮ A logical duality for underspecified probabilistic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic PDL
• Bisimulation through probabilistic testing
• A calculus of mobile processes. I
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Bisimulation and cocongruence for probabilistic systems
• Bisimulation for labelled Markov processes
• Theory of capacities
• Least Upper Bounds for Probability Measures and Their Applications to Abstractions
• Continuous Capacities on Continuous State Spaces
• Foundations of Software Science and Computational Structures
• Model Checking Software

This page was built for publication: A Demonic Approach to Information in Probabilistic Systems