In this paper we consider Milner’s calculus CCS enriched by a probabilistic choice operator. The calculus is given operational semantics based on probabilistic transition systems. We define operational notions of preorder and equivalence as probabilistic extensions of the simulation preorder and the bisimulation equivalence respectively. We extend existing category-theoretic techniques for solv...

We investigate hierarchical properties and log-space reductions of languages recognized by log-space probabilistic Turing machines, Arthur-Merlin games and Games against Nature with log-space probabilistic veriiers. For each log-space complexity class, we decompose it into a hierarchy based on corresponding multihead two-way nite automata and we (eventually) prove the separation of the hierarch...

the current study investigated and compared data generation methods for groundwater modeling. thesemethods can be divided into two classes; geostatistic and probabilistic. by comparing geostatistic methods,the best method was chosen and the hydraulic conductivity of the aquifer was generated for a study area ina grid (9-cell) format. after observing weak spatial correlation between the data, th...

In this paper, we give a kind of Cauchy 1-completeness in probabilistic quasi-uniform spaces by using 1-filters. Utilizingthe relationships among probabilistic quasi-uniformities, classical quasi-uniformities and Hutton [0, 1]-quasi-uniformities,we show the relationships between their completeness. In fuzzy quasi-metric spaces, we establish the relationshipsbetween the completeness of induced p...

k-Hierarchical probabilistic automata (k-HPA) are probabilistic automata whose states are stratified into k + 1 levels such that from any state, on any input symbol, at most one successor belongs to the same level, while the remaining belong to higher levels. Our main result shows that the emptiness and universality problems are decidable for k-HPAs with isolated cut-points; recall that a cut-p...

In this paper, we consider complete menger probabilistic quasimetric space and prove a common fixed point theorem for commuting maps in this space.

A complete and decidable Hoare-style calculus for iteration-free probabilistic sequential programs is presented using a state logic with truth-functional propositional (not arithmetical) connectives.

This article presents a probabilistic logic whose sentences can be interpreted as asserting the acceptability of gambles described in terms of an underlying logic. This probabilistic logic has a concrete syntax and a complete inference procedure, and it handles conditional as well as unconditional probabilities. It synthesizes Nilsson’s probabilistic logic and Frisch and Haddawy’s anytime infer...