General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...

In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. images that show the average state of each cell during the stochastic cellular automaton evolution. The s...

We discuss a new model for the analysis and simulation of stochastic systems which we call stochastic automata. Basically, they are a combination of the timed automata model and generalised semi-Markov processes (GSMPs for short). We discuss their behaviour and we compare them to the GSMPs model. In addition, we deene a stochastic process algebra that supports general distribution (both continu...