Improving Time Bounded Reachability Computations in Interactive Markov Chains

DOI10.1007/978-3-642-40213-5_16zbMath1434.68337OpenAlexW1623473440MaRDI QIDQ2948248

Holger Hermanns, Hassan Hatefi

Publication date: 30 September 2015

Published in: Fundamentals of Software Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40213-5_16

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Scenario-Based Verification of Uncertain MDPs, A Tutorial on Interactive Markov Chains, Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Efficient approximation of optimal control for continuous-time Markov games

Uses Software

• CADP