Advertisement

Probabilistic Automata on Infinite Words: Decidability and Undecidability Results

  • Krishnendu Chatterjee
  • Thomas A. Henzinger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6252)

Abstract

We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present an almost complete characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems for probabilistic automata on infinite words.

Keywords

Decision Problem Safety Condition Limit Problem Reachability Condition Acceptance Probability 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BBG08]
    Baier, C., Bertrand, N., Größer, M.: On decision problems for probabilistic Büchi automata. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 287–301. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  2. [BG05]
    Baier, C., Größer, M.: Recognizing omega-regular languages with probabilistic automata. In: LICS, pp. 137–146 (2005)Google Scholar
  3. [BGG09]
    Bertrand, N., Genest, B., Gimbert, H.: Qualitative determinacy and decidability of stochastic games with signals. In: LICS. IEEE, Los Alamitos (2009)Google Scholar
  4. [BMT77]
    Bertoni, A., Mauri, G., Torelli, M.: Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol. 52, pp. 87–94. Springer, Heidelberg (1977)CrossRefGoogle Scholar
  5. [Buk80]
    Bukharaev, R.G.: Probabilistic automata. Jorunal of Mathematical Sciences 13, 359–386 (1980)zbMATHGoogle Scholar
  6. [GO09]
    Gimbert, H., Oualhadj, Y.: Automates probabilistes: problémes décidables et indécidables. In: Rapport de Recherche RR-1464-09 LaBRI (Conference version to appear ICALP 2010) (2009)Google Scholar
  7. [HU79]
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company, Reading (1979)zbMATHGoogle Scholar
  8. [Paz71]
    Paz, A.: Introduction to probabilistic automata, Computer science and applied mathematics. Academic Press, London (1971)Google Scholar
  9. [Rab63]
    Rabin, M.O.: Probabilistic automata. Information and Control 6, 230–245 (1963)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Krishnendu Chatterjee
    • 1
  • Thomas A. Henzinger
    • 1
  1. 1.IST Austria (Institute of Science and Technology Austria)Austria

Personalised recommendations