YMCA: why Markov chain algebra?
DOI10.1016/J.ENTCS.2005.12.108zbMATH Open1316.68088DBLPjournals/entcs/BravettiHK06OpenAlexW2154619665WikidataQ57801839 ScholiaQ57801839MaRDI QIDQ5262955FDOQ5262955
Mario Bravetti, Holger Hermanns, Joost-Pieter Katoen
Publication date: 10 July 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2005.12.108
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interactive Markov chains. And the quest for quantified quality
- Automated compositional Markov chain generation for a plain-old telephone system
- Revisiting interactive Markov chains
- Process algebra for performance evaluation
- The theory of interactive generalized semi-Markov processes
- Specification styles in distributed systems design and verification
- Compositional asymmetric cooperations for process algebras with probabilities, priorities, and time
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)
