On Decision Problems for Probabilistic Büchi Automata.

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 omega-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.
Type de document :
Communication dans un congrès
11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Apr 2008, Budapest, Hungary. Springer, 4962, pp.287-301, 2008, LNCS
Liste complète des métadonnées

https://hal.inria.fr/inria-00424524
Contributeur : Nathalie Bertrand <>
Soumis le : vendredi 16 octobre 2009 - 11:12:01
Dernière modification le : mercredi 29 novembre 2017 - 16:21:16

Identifiants

  • HAL Id : inria-00424524, version 1

Collections

Citation

Christel Baier, Nathalie Bertrand, Marcus Größer. On Decision Problems for Probabilistic Büchi Automata.. 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Apr 2008, Budapest, Hungary. Springer, 4962, pp.287-301, 2008, LNCS. 〈inria-00424524〉

Partager

Métriques

Consultations de la notice

96