269 search results - page 31 / 54 » Computing with Probabilistic Cellular Automata |
CONCUR
2011
Springer
12 years 8 months ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
BIRTHDAY
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
DLT
2009
13 years 6 months ago
2009
While a mature theory around logics such as MSO, LTL, and CTL has been developed in the pure boolean setting of finite automata, weighted automata lack such a natural connection wi...
ALT
2010
Springer
13 years 5 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
FUIN
2002
13 years 8 months ago
2002
One-way and two-way cellular language acceptors with restricted nondeterminism are investigated. The number of nondeterministic state transitions is regarded as limited resource wh...