Name
Abstract | ||
|---|---|---|
Probabilistic ω-automata are variants of nondeterministic automata for infinite words where all choices are resolved by probabilistic distributions. Acceptance of an infinite input word requires that the probability for the accepting runs is positive. In this paper, we provide a summary of the fundamental properties of probabilistic ω-automata concerning expressiveness, efficiency, compositionality and decision problems. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-540-95891-8_3 | SOFSEM |
Keywords | Field | DocType |
infinite words,probabilistic distribution,fundamental property,infinite word,decision problem,nondeterministic automaton,infinite input word,probabilistic acceptors | Principle of compositionality,Discrete mathematics,Decision problem,Computer science,Markov decision process,Probabilistic CTL,Composition operator,Probabilistic logic,Expressivity,Nondeterministic automata | Conference |
Volume | ISSN | Citations |
5404 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christel Baier | 1 | 3053 | 185.85 |
| Nathalie Bertrand | 2 | 250 | 17.84 |
| Marcus Größer | 3 | 334 | 18.23 |