In big data query processing, there is a trade-off between accuracy and efficiency, for example, sampling approaches completeness efficiency. this article, we argue that performance can be significantly improved by slightly losing the possibility of completeness, is, chance complete. To quantify possibility, define new concept, Probability Completeness (hereinafter referred to as PC). For If ex...

We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider strong bisimulation and observational equivalence, and provide complete axiomatizations for a language that includes parallel composition and (guarded) recursion. The presence of the parallel composition introduces various techn...

the notion of a probabilistic metric  space  corresponds to thesituations when we do not know exactly the  distance.  probabilistic metric space was  introduced by karl menger. alsina, schweizer and sklar gave a general definition of  probabilistic normed space based on the definition of menger [1]. in this note we study the pn spaces which are  topological vector spaces and the open mapping an...

In this paper, the connection between Menger probabilistic norms and H"{o}hle probabilistic norms is discussed. In addition, the correspondence between probabilistic norms and Wu-Fang fuzzy (semi-) norms is established. It is shown that a probabilistic norm (with triangular norm $min$) can generate a Wu-Fang fuzzy semi-norm and conversely, a Wu-Fang fuzzy norm can generate a probabilistic norm.

in this paper, we improve some recent coupled fixed point resultsfor single-valued operators in the framework of ordered $b$-metricspaces established by bota et al. [m-f. bota, a. petrusel, g.petrusel and b. samet, coupled fixed point theorems forsingle-valued operators in b-metric spaces, fixed point theoryappl. (2015) 2015:231]. also, we prove that perov-type fixed pointtheorem in ordered gen...

We present locally complete inference rules for probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Crucially, in contrast to similar inference rules in the literature, our inference rules are locally complete for conjunctive events and under additional taxonomic knowledge. We discover that our inference rules are extremely complex and that it is at...

We introduce and study a natural notion of probabilistic 1Lipschitz maps. We prove that the space of all probabilistic 1-Lipschitz maps defined on a probabilistic metric space G is also a probabilistic metric space. Moreover, when G is a group, then the space of all probabilistic 1-Lipschitz maps defined on G can be endowed with a monoid structure. Then, we caracterize the probabilistic invaria...

We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and non-deterministic branching, generalising the classical notion of pushdown automata (without ε-transitions). We first show a general characterization of probabilistic bisimilarity in terms of two-player games, which naturally reduces checking ...

We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguard...

This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence result, we provide a sound and complete axiomatisation for the barbed congruence in a finite fragment of probabilistic CCS.