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...

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.

a r t i c l e i n f o a b s t r a c t MSC: 34D20 34K50 60H10 93E15 Keywords: Pure delay system Two-timescale Markov chain Stationary distribution Almost sure uniform stability Yorke's condition This work examines almost sure stability of a pure random delay system whose delay time is modeled by a finite state continuous-time Markov chain with two-time scales. The Markov chain contains a fast-va...