The how and why of interactive Markov chains
From MaRDI portal
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)
Recommendations
Cites work
- A Compositional Approach to Performance Modelling
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- A Theory of Communicating Sequential Processes
- A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
- Automated compositional Markov chain generation for a plain-old telephone system
- Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes
- Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
- Branching time and abstraction in bisimulation semantics
- Comparative branching-time semantics for Markov chains
- Compositional abstraction for stochastic systems
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- Concurrency and composition in a stochastic world
- Deciding bisimilarity and similarity for probabilistic processes.
- Delayed Nondeterminism in Continuous-Time Markov Decision Processes
- Dynamic fault-tree models for fault-tolerant computer systems
- Exact and ordinary lumpability in finite Markov chains
- Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
- GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets
- Handbook of process algebra
- scientific article; zbMATH DE number 4110131 (Why is no real title available?)
- scientific article; zbMATH DE number 1095138 (Why is no real title available?)
- scientific article; zbMATH DE number 1786475 (Why is no real title available?)
- scientific article; zbMATH DE number 2090149 (Why is no real title available?)
- scientific article; zbMATH DE number 763717 (Why is no real title available?)
- Interactive Markov chains. And the quest for quantified quality
- Model Checking Interactive Markov Chains
- Model Checking Software
- Process algebra for performance evaluation
- Rate-Based Transition Systems for Stochastic Process Calculi
- Sigref – A Symbolic Bisimulation Tool Box
- Specification styles in distributed systems design and verification
- Structural Operational Semantics for Stochastic Process Calculi
- Three-Valued Abstraction for Continuous-Time Markov Chains
- Towards Performance Prediction of Compositional Models in Industrial GALS Designs
- YMCA: why Markov chain algebra?
Cited in
(24)- The theory of interactive generalized semi-Markov processes
- A compositional model to reason about end-to-end QoS in stochastic Reo connectors
- Distributed synthesis in continuous time
- Compositional verification and optimization of interactive Markov chains
- Revisiting interactive Markov chains
- A Tutorial on Interactive Markov Chains
- Improving time bounded reachability computations in interactive Markov chains
- Verification of open interactive Markov chains
- Model checking probabilistic systems
- Model checking compositional Markov systems.
- Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
- Interactive infinite Markov particle systems with jumps
- A note on the substitution process as an interactive Markov Chain
- scientific article; zbMATH DE number 1786475 (Why is no real title available?)
- scientific article; zbMATH DE number 1397300 (Why is no real title available?)
- A theory of distributed Markov chains
- Confluence reduction for Markov automata
- Compositional design of stochastic timed automata
- The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
- Equivalence checking 40 years after: a review of bisimulation tools
- Convex language semantics for nondeterministic probabilistic automata
- Interactive Markov chains. And the quest for quantified quality
- A definition scheme for quantitative bisimulation
- Stochastically timed predicate-based communication primitives for autonomic computing
This page was built for publication: The how and why of interactive Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066128)
