This paper considers the problem of veriication of proba-bilistic systems, for both the discrete-and real-time cases. Probabilistic systems are modeled as Markov chains, concurrent Markov chains (i.e. MCs with non-determinism) or, in the real-time case, generalized semi-Markov processes (Markovian processes with time delays on events). Discrete-time speciications are described in the logics PTL...

Recurrence Quantification Analysis (RQA) is a method for measuring the complexity of dynamical systems. determinism fundamental characteristic RQA, closely related to correlation sum. In this paper, we study asymptotic behavior these quantities interval maps. We show which cases sum exists. An example an map with zero entropy and point finite [Formula: see text]-limit set does not exist given. ...

We extend the Interaction Nets of Lafont with some non determinism capabilities and then show how to implement the nite monadic calculus in that system Introduction The calculus of Milner et al is one of the most popular theoretical tools for the investigation of concurrent computations Its popularity is due to its con ceptual simplicity yet great expressive power However similar to the calculu...

Peptide computer is a formal model for peptide computing. It involve reactions between various multiset of symbols and sequences. We study three kinds of nondeterminism in peptide computer – global, locally-global and local. We show that (local) locally-global is a restrictive version of (locally-global) global. We also characterize conditions for a (locally-global) global system to be a system...

We study the combination of probability and nondeterminism from a categorical point of view. In category theory, nondeterminism and probability are represented by suitable monads. Those two monads do not combine well, as they are. To overcome this problem we introduce the notion of indexed valuations. This notion is used to define a new monad that can be combined with the usual nondeterministic...

The development of distributed execution engines has greatly simplified parallel programming, by shielding developers from the gory details of programming in a distributed system, and allowing them to focus on writing sequential code [8, 11, 18]. The “sacred cow” in these systems is transparent fault tolerance, which is achieved by dividing the computation into atomic tasks that execute determi...

We are concerned with Kolmogorov complexity of strings produced by non-deterministic algorithms. For this, we consider five classes of non-deterministic description modes : (i) Bounded description modes in which the number of outputs depends on programs, (ii) distributed description modes in which the number of outputs depends on the size of the outputs, (iii) spread description modes in which ...

We study the notion of solvability in the resource calculus, an extension of the λ-calculus modelling resource consumption. Since this calculus is non-deterministic, two different notions of solvability arise, one optimistic (angelical, may) and one pessimistic (demoniac, must). We give a syntactical, operational and logical characterization for the may-solvability and only a partial characteri...

Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among threads. Most modern software model checkers can handle only one source of non-determinism efficiently, but not both. This paper describes a SAT-based model checker for asynchronous Boolean programs that handles both sources effec...

This paper presents a detailed comparison between two search optimization techniques for large vocabulary speech recognition – one based on word-conditioned tree search (WCTS) and one based on weighted finite-state transducers (WFSTs). Existing North American Business News systems from RWTH and AT&T representing each of the two approaches, were modified to remove variations in model data and ac...