Name
Abstract | ||
|---|---|---|
Probabilistic Büchi automata (PBA) are finite-state acceptors for infinite words where all choices are resolved by fixed distributions and where the accepted language is defined by the requirement that the measure of the accepting runs is positive. The main contribution of this paper is a complementation operator for PBA and a discussion on several algorithmic problems for PBA. All interesting problems, such as checking emptiness or equivalence for PBA or checking whether a finite transition system satisfies a PBA-specification, turn out to be undecidable. An important consequence of these results are several undecidability results for stochastic games with incomplete information, modelled by partially-observable Markov decision processes and ω-regular winning objectives. Furthermore, we discuss an alternative semantics for PBA where it is required that almost all runs for an accepted word are accepting, which turns out to be less powerful, but has a decidable emptiness problem. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-78499-9_21 | FoSSaCS |
Keywords | Field | DocType |
accepted language,alternative semantics,decision problem,probabilistic b,complementation operator,accepted word,decidable emptiness problem,algorithmic problem,chi automaton,finite-state acceptors,finite transition system,incomplete information,satisfiability | Transition system,Discrete mathematics,Combinatorics,Decision problem,Computer science,Markov decision process,Decidability,Equivalence (measure theory),Probabilistic logic,Büchi automaton,Undecidable problem | Conference |
Volume | ISSN | ISBN |
4962 | 0302-9743 | 3-540-78497-7 |
Citations | PageRank | References |
51 | 2.48 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Christel Baier | 1 | 3053 | 185.85 |
| Nathalie Bertrand | 2 | 250 | 17.84 |
| Marcus Größer | 3 | 334 | 18.23 |