We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative ...

This paper describes a generalization of the relational model in order to capture and manipulate a type of probabilistic information. Probabilistic databases are formalized by means of logic theories based on a probabilistic first-order language proposed by Halpern. A sound a complete method is described for evaluating queries in probabilistic theories. The generalization proposed can be incorp...

Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised sampling in important areas result in a high performance path planning method. Even if it was postulated before that PCD is probabilistically complete, we p...

We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a simple probabilistic version of the process calculus CSP. We examine the algebraic theory of probabilistic testing, and show that many of the axioms of standard testing are no longer valid in our probabilistic setting; e...

Adapting the competitions method of Freivalds to the setting of unbounded-error prob-abilistic computation, we prove that, for any 2 (0; 1], Band-Mat-Inv(n) is log-space complete for the class of languages recognized by log-space unbounded-error probabilistic Turing machines (PL). This extends the result of Jung that Band-Mat-Inv(n) is log-space complete for PL, and may open new possibilities f...

in this paper, a new enhanced version of the particle swarm optimization (pso) is presented. an important modification is made by adding probabilistic functions into pso, and it is named probabilistic particle swarm optimization (ppso). since the variation of the velocity of particles in pso constitutes its search engine, it should provide two phases of optimization process which are: explorati...

We study a syntax for specifying quantitative assertions —functions mapping program states to numbers—for probabilistic verification. prove that our is expressive in the following sense: Given any C , if function f expressible syntax, then each initial state σ expected value of evaluated final reached after termination on (also called weakest preexpectation wp[ ]( )) also syntax. As consequence...

We present a cryptosystem which is complete for the class of probabilistic public-key cryptosystems with bounded error. Besides traditional encryption schemes such as RSA and El Gamal, this class contains probabilistic encryption of Goldwasser-Micali as well as Ajtai-Dwork and NTRU cryptosystems. The latter two are known to make errors with some small positive probability. To our best knowledge...