Stochastic language models are widely used in spoken language understanding to recognize and interpret the speech signal: the speech samples are decoded into word transcriptions by means of acoustic and syntactic models and then interpreted according to a semantic model. Both for speech recognition and understanding, search algorithms use stochastic models to extract the most likely uttered sen...

In this paper, the concept of fuzzy automata normed linear structure spaces is introduced and suitable examples are provided. ;The ;concepts of fuzzy automata $alpha$-open sphere, fuzzy automata $mathscr{N}$-locally compact spaces, fuzzy automata $mathscr{N}$-Hausdorff spaces are also discussed. Some properties related with to fuzzy automata normed linear structure spaces and fuzzy automata $ma...

The following analytical approaches: queuing network models, stochastic automata networks, stochastic timed Petri nets, stochastic process algebra, Markov chains can be used in performance evaluation of multi–agent systems. In this paper, new approach which is based on PERT networks is presented. This approach is applied in performance evaluation of layered multi–agent system. Time-out mechanis...

We consider previous models of Timed, Probabilistic and Stochastic Timed Automata, we introduce our model of Timed Automata with Polynomial Delay and we characterize the expressiveness of these models relative to each other. Timed and probabilistic automata may be used for modelling systems that exhibit timed and probabilistic behaviour as diverse as safety-critical navigation, web security, al...

CPDP is a class of automata designed for compositional specification/analysis of certain stochastic hybrid processes. We prove equivalence of the stochastic behaviors of CPDPs (newly defined here) and PDPs. With this result we obtain a clear stochastic processes semantics for CPDPs and we obtain the opportunity to use the powerful PDP analysis techniques in the context of the compositional fram...

We define a semantics for stochastic Concurrent Constraint Programming (sCCP), a stochastic process algebra, in terms of stochastic hybrid automata with piecewise deterministic continuous dynamics. To each program we associate a lattice of hybrid models, parameterized with respect to the degree of discreteness left. We study some properties of this lattice, presenting also an alternative semant...

We present uniformly four related models for the representation of biochemical systems recently proposed in the literature in different publications. Namely, we consider Stochastic Automata Collectives (SAC) [2], Stochastic Polyautomata Collectives (SPC) [2], Chemical Ground Form (CGF) [3], and Biochemical Ground Form (BGF) [4].

Stochastic HYPE is a novel process algebra that models stochastic, instantaneous and continuous behaviour. It develops the flow-based approach of the hybrid process algebra HYPE by replacing non-urgent events with events with exponentially-distributed durations and also introduces random resets. The random resets allow for general stochasticity, and in particular allow for the use of event dura...