Abstract
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our survey is carried out from the perspective of probabilistic automata, a model originally developed for the analysis of randomized distributed algorithms. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Segala, R. (2006). Probability and nondeterminism in operational models of concurrency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4137 LNCS, pp. 64–78). Springer Verlag. https://doi.org/10.1007/11817949_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
