163 search results - page 6 / 33 » An Introduction to Probabilistic Automata |
WSC
2007
15 years 5 months ago
2007
84
Voted
OWLED
2008
15 years 4 months ago
2008
125
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
136
click to vote
QEST
2008
IEEE
15 years 9 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...