The How and Why of Interactive Markov Chains

DOI10.1007/978-3-642-17071-3_16zbMath1312.68152WikidataQ57801490 ScholiaQ57801490MaRDI QIDQ3066128

Holger Hermanns, Joost-Pieter Katoen

Publication date: 8 January 2011

Published in: Formal Methods for Components and Objects (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/the-how-and-why-of-interactive-markov-chains(93e714e7-d686-4dcb-b514-dfad7b6899e9).html

Mathematics Subject Classification ID

60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q87: Probability in computer science (algorithm analysis, random structures, phase transitions, etc.)

Related Items

A Tutorial on Interactive Markov Chains

Uses Software

• GreatSPN
• SIGREF
• PRISM
• GreatSPN 1.7
• LOTOS
• E-LOTOS
• CADP
• PEPA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
• Specification styles in distributed systems design and verification
• Automated compositional Markov chain generation for a plain-old telephone system
• Deciding bisimilarity and similarity for probabilistic processes.
• Comparative branching-time semantics for Markov chains
• GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• Sigref – A Symbolic Bisimulation Tool Box
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
• Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
• Model Checking Interactive Markov Chains
• Concurrency and Composition in a Stochastic World
• Delayed Nondeterminism in Continuous-Time Markov Decision Processes
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Towards Performance Prediction of Compositional Models in Industrial GALS Designs
• Compositional Abstraction for Stochastic Systems
• A Theory of Communicating Sequential Processes
• Dynamic fault-tree models for fault-tolerant computer systems
• Exact and ordinary lumpability in finite Markov chains
• Branching time and abstraction in bisimulation semantics
• YMCA
• Rate-Based Transition Systems for Stochastic Process Calculi
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Structural Operational Semantics for Stochastic Process Calculi
• A Compositional Approach to Performance Modelling
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Model Checking Software
• Process algebra for performance evaluation