Improving time bounded reachability computations in interactive Markov chains

DOI10.1007/978-3-642-40213-5_16MaRDI QIDQ2948248zbMATH OpenOpenAlexFDO

Authors Hassan Hatefi, Holger Hermanns

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Approximation algorithms (68W25)

Recommendations

• A Tutorial on Interactive Markov Chains
• Compositional verification and optimization of interactive Markov chains
• Model Checking Interactive Markov Chains
• The how and why of interactive Markov chains
• Verification of open interactive Markov chains

Cited in

(6)

• Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
• Efficient approximation of optimal control for continuous-time Markov games
• A Tutorial on Interactive Markov Chains
• Scenario-based verification of uncertain MDPs
• The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
• MeGARA: menu-based game abstraction and abstraction refinement of Markov automata

Describes a project that uses

Uses Software

• CADP

This page was built for publication: Improving time bounded reachability computations in interactive Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948248)