in this paper, we introduce the  probabilistic normed groups. among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. we also study midconvex functions defined  on probabilistic normed groups and  give  some results about locally boundedness of such  functions.

nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. in this work we introduce this concept in an $s$-poset, aposet with an action of a posemigroup $s$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $s$-net. using $s$-nets and itsconvergency we...

In this paper, we define the concepts of modified intuitionistic probabilistic metric spaces, the property (E.A.) and  the common property (E.A.) in   modified  intuitionistic probabilistic metric spaces.Then, by the commonproperty (E.A.), we prove some common fixed point theorems in modified intuitionistic Menger probabilistic metric spaces satisfying an implicit relation.

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been defined in the setting of probabilist...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

The formalism of probabilistic languages has been introduced for modeling the qualitative behavior of stochastic discrete event systems. A probabilistic language is a unit interval valued map over the set of traces of the system satisfying certain consistency constraints. Regular language operators such as choice, concatenation, and Kleene-closure have been de ned in the setting of probabilisti...

Paper formulates the problem of multiobjective probabilistic mixture control design and proposes its general solution with both system model and target represented by finite probabilistic mixtures. A complete feasible algorithmic solution for mixtures with components formed by normal auto-regression models with external variable is provided. Copyright c ©2005 IFAC

This paper studies the connection between probabilistic conditional independence in un­ certain reasoning and data dependency in re­ lational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof is presented for refuting the conjecture suggested by Pearl and Paz that probabilistic conditional independencies have a complete axiomatization.

We present iSAPP (Imperative Static Analyser for Probabilistic Polynomial Time), a complexity verifier tool that is sound and extensionally complete for the Probabilistic Polynomial Time (PP) complexity class. iSAPP works on an imperative programming language for stack machines. The certificate of polynomiality can be built in polytime, with respect to the number of stacks used. 1998 ACM Subjec...