Model Checking Interactive Markov Chains
From MaRDI portal
Publication:3557065
DOI10.1007/978-3-642-12002-2_5zbMath1284.68420MaRDI QIDQ3557065
Martin R. Neuhäußer, Li-jun Zhang
Publication date: 27 April 2010
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12002-2_5
68Q60: Specification and verification (program logics, model checking, etc.)
68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)
Related Items
A Semantics for Every GSPN, The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism, Efficient approximation of optimal control for continuous-time Markov games, Confluence reduction for Markov automata, Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games, Model checking for performability, A Tutorial on Interactive Markov Chains, The How and Why of Interactive Markov Chains