Least upper bounds for probability measures and their applications to abstractions
DOI10.1016/j.ic.2013.12.003zbMath1282.68176OpenAlexW2119043028MaRDI QIDQ2637319
Ramesh Viswanathan, Mahesh Viswanathan, Rohit Chadha
Publication date: 11 February 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.12.003
Continuous-time Markov processes on general state spaces (60J25) Discrete-time Markov processes on general state spaces (60J05) Markov and semi-Markov decision processes (90C40) Probabilistic measure theory (60A10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparative branching-time semantics for Markov chains
- Abstract interpretation of programs as Markov decision processes
- On finite-state approximants for probabilistic computation tree logic
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions
- Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Validation of Stochastic Systems
- Validation of Stochastic Systems
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Model-checking continuous-time Markov chains
- Probability and Nondeterminism in Operational Models of Concurrency
- Model Checking Software
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Least upper bounds for probability measures and their applications to abstractions
