On Decision Problems for Probabilistic Büchi Automata
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.
- [BRV04]Bustan, D., Rubin, S., Vardi, M.: Verifying ω-regular properties of Markov chains. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 189–201. Springer, Heidelberg (2004)Google Scholar
- [Cas98]Cassandra, A.R.: A survey of POMD applications. Presented at the AAAI Fall Symposium (1998), http://pomdp.org/pomdp/papers/applications.pdf
- [dA99]de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. In: Proc. Workshop on Probabilistic Methods in Verification (ProbMiV 1999), Birmingham University, Research Report CSR-99-9, pp. 19–32 (1999)Google Scholar
- [KSK66]Kemeny, J.G., Snell, J.L., Knapp, A.W.: Denumerable Markov chains. D. Van Nostrand Co (1966)Google Scholar
- [Tho90]Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol. B, ch. 4, pp. 133–191. Elsevier, Amsterdam (1990)Google Scholar
- [Var85]Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. 26th Symposium on Foundations of Computer Science (FOCS 1985), pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)Google Scholar