YMCA: why Markov chain algebra?
From MaRDI portal
Publication:5262955
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
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- Automated compositional Markov chain generation for a plain-old telephone system
- Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
- Interactive Markov chains. And the quest for quantified quality
- Process algebra for performance evaluation
- Revisiting interactive Markov chains
- Specification styles in distributed systems design and verification
- The theory of interactive generalized semi-Markov processes
Cited in
(5)
This page was built for publication: YMCA: why Markov chain algebra?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262955)