A logical duality for underspecified probabilistic systems
From MaRDI portal
Publication:532396
DOI10.1016/J.IC.2010.12.005zbMath1222.68119OpenAlexW2087666725MaRDI QIDQ532396
François Laviolette, Amélie Turgeon, Josée Desharnais
Publication date: 4 May 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2010.12.005
Logic in computer science (03B70) 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)
A Theory for the Semantics of Stochastic and Non-deterministic Continuous Systems ⋮ Bisimilarity is not Borel
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-additive measures by interval probability functions
- Extreme lower probabilities
- A probabilistic PDL
- Bisimulation through probabilistic testing
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation and cocongruence for probabilistic systems
- Bisimulation for labelled Markov processes
- Theory of capacities
- Domain equations for probabilistic processes
- Risk, Ambiguity, and the Savage Axioms
- A Demonic Approach to Information in Probabilistic Systems
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Foundations of Software Science and Computation Structures
- Continuous Capacities on Continuous State Spaces
- Foundations of Software Science and Computational Structures
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Model Checking Software
- Approximating Markov Processes by Averaging
This page was built for publication: A logical duality for underspecified probabilistic systems
