Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with single algebraic operation, namely construct for binary probabilistic choice. What matters about such computations is the probability of obtaining any given result, rather than possibility or necessity it, like in (non)deterministic computation. Termination, arguably simplest kind reachability pr...

Markov decision processes (MDP) are finite-state systems with both strategic and probabilistic choices. After fixing a strategy, an MDP produces a sequence of probability distributions over states. The sequence is eventually synchronizing if the probability mass accumulates in a single state, possibly in the limit. Precisely, for 0 ≤ p ≤ 1 the sequence is p-synchronizing if a probability distri...

In this paper, we will discuss the concept of almost sure convergence for specic groups of fuzzyrandom variables. For this purpose, we use the type of generalized Chebyshev inequalities.Moreover, we show the concept of almost sure convergence of weighted average pairwise NQDof fuzzy random variables.