A Tutorial on Interactive Markov Chains

DOI10.1007/978-3-662-45489-3_2zbMath1426.68187OpenAlexW1544169416MaRDI QIDQ2937729

Florian Arnold, Daniel Gebler, Hassan Hatefi, Dennis Guck

Publication date: 12 January 2015

Published in: Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-45489-3_2

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)

Uses Software

• PRISM
• MRMC
• VESTA
• Ymer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• CCS expressions, finite state processes, and three problems of equivalence
• Bisimulation through probabilistic testing
• A logic for reasoning about time and reliability
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Efficient Modelling and Generation of Markov Automata
• Improving Time Bounded Reachability Computations in Interactive Markov Chains
• Model checking of probabilistic and nondeterministic systems
• Verification of Open Interactive Markov Chains
• The How and Why of Interactive Markov Chains
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• On the Minimisation of Acyclic Models
• Model Checking Interactive Markov Chains
• Concurrency and Composition in a Stochastic World
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• An Analysis of Stochastic Shortest Path Problems
• YMCA
• Validation of Stochastic Systems
• Computer Aided Verification

This page was built for publication: A Tutorial on Interactive Markov Chains