A Tutorial on Interactive Markov Chains

DOI10.1007/978-3-662-45489-3_2MaRDI QIDQ2937729zbMATH OpenOpenAlexFDO

Authors Florian Arnold, Daniel Gebler, Dennis Guck, Hassan Hatefi

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) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1397300
• The how and why of interactive Markov chains
• Revisiting interactive Markov chains
• Markov chains. From theory to implementation and experimentation
• An introduction to intuitionistic Markov chain
• Interactive Markov chains. And the quest for quantified quality
• Asymptotic properties of interactive markov chains
• Model Checking Interactive Markov Chains
• Model checking interactive Markov chains

Cites work

• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1361118 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 2087806 (Why is no real title available?)
• scientific article; zbMATH DE number 1884412 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• A logic for reasoning about time and reliability
• An Analysis of Stochastic Shortest Path Problems
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• Bisimulation through probabilistic testing
• CCS expressions, finite state processes, and three problems of equivalence
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
• Computer Aided Verification
• Concurrency and composition in a stochastic world
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Efficient modelling and generation of Markov automata
• Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification
• Improving time bounded reachability computations in interactive Markov chains
• Interactive Markov chains. And the quest for quantified quality
• Model Checking Interactive Markov Chains
• Model checking compositional Markov systems.
• Model checking of probabilistic and nondeterministic systems
• On the Minimisation of Acyclic Models
• The how and why of interactive Markov chains
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Validation of Stochastic Systems
• Verification of open interactive Markov chains
• YMCA: why Markov chain algebra?

Cited in

(6)

• The how and why of interactive Markov chains
• Interactive Markov chains. And the quest for quantified quality
• Compositional verification and optimization of interactive Markov chains
• Improving time bounded reachability computations in interactive Markov chains
• Verification of open interactive Markov chains
• scientific article; zbMATH DE number 1397300 (Why is no real title available?)

Describes a project that uses

Uses Software

• Ymer
• VESTA
• MRMC
• PRISM

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

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