Christel Baier
Skip Abstract Section
Abstract
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions. Acceptance of a run for an infinite input word can be defined using traditional acceptance criteria for ω-automata, such as Büchi, Rabin or Streett conditions. The accepted language of a probabilistic ω-automata is then defined by imposing a constraint on the probability measure of the accepting runs. In this paper, we study a series of fundamental properties of probabilistic ω-automata with three different language-semantics: (1) the probable semantics that requires positive acceptance probability, (2) the almost-sure semantics that requires acceptance with probability 1, and (3) the threshold semantics that relies on an additional parameter λ ∈ ]0,1[ that specifies a lower probability bound for the acceptance probability. We provide a comparison of probabilistic ω-automata under these three semantics and nondeterministic ω-automata concerning expressiveness and efficiency. Furthermore, we address closure properties under the Boolean operators union, intersection and complementation and algorithmic aspects, such as checking emptiness or language containment.
- Alur, R., Courcoubetis, C., and Yannakakis, M. 1995. Distinguishing tests for nondeterministic and probabilistic machines. In Proceedings of the 27th ACM Symposium on Theory of Computing (STOC'95). ACM, 363--372. Google Scholar
Digital Library
- Ambainis, A. 1996. The complexity of probabilistic versus deterministic finite automata. In Proceedings of the 7th International Symposium on Algorithms and Computation (ISAAC'96). Lecture Notes in Computer Science, vol. 1178, Springer, 233--238. Google ScholarDigital Library
- Andrés, M. E., Palamidessi, C., van Rossum, P., and Sokolova, A. 2010. Information hiding in probabilistic concurrent systems. In Proceedings of the 7th International Conference on Quantitative Evaluation of Systems (QEST'10). IEEE Computer Society, 17--26. Google ScholarDigital Library
- Baier, C., Bertrand, N., and Grösser, M. 2008. On decision problems for probabilistic Büchi automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FOSSACS'08). Lecture Notes in Computer Science, vol. 4962, Springer, 287--301. Google ScholarDigital Library
- Baier, C. and Grösser, M. 2005. Recognizing ω-regular languages with probabilistic automata. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS'05). IEEE Computer Society, 137--146. Google ScholarDigital Library
- Bertrand, N., Genest, B., and Gimbert, H. 2009. Qualitative determinacy and decidability of stochastic games with signals. In Proceedings of the 24th IEEE Symposium on Logic in Computer Science (LICS'09). IEEE Computer Society, 319--328. Google ScholarDigital Library
- Bianco, A. and de Alfaro, L. 1995. Model checking of probabilistic and non-deterministic systems. In Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'95). Lecture Notes in Computer Science, vol. 1026, Springer, 499--513. Google ScholarDigital Library
- Blondel, V. and Canterini, V. 2003. Undecidable problems for probabilistic finite automata. Theory Comput. Syst. 36, 231--245.Google ScholarCross Ref
- Burago, D., de Rougemont, M., and Slissenko, A. 1996. On the complexity of partially observed Markov decision processes. Theoret. Comput. Sci. 157, 2, 161--183. Google ScholarDigital Library
- Chadha, R., Sistla, A. P., and Viswanathan, M. 2009a. On the expressiveness and complexity of randomization in finite state monitors. J. ACM 56, 5. Google ScholarDigital Library
- Chadha, R., Sistla, A. P., and Viswanathan, M. 2009b. Power of randomization in automata on infinite strings. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09). Lecture Notes in Computer Science, vol. 5710, Springer, 229--243. Google ScholarDigital Library
- Chadha, R., Sistla, A. P., and Viswanathan, M. 2011. Probabilistic Büchi automata with non-extremal acceptance thresholds. In Proceedings of the 12th International Conference on Verification, Model Checking, and Abstract Interpretation. Lecture Notes in Computer Science, vol. 6538, Springer, 103--117. Google ScholarDigital Library
- Chatterjee, K., Doyen, L., and Henzinger, T. 2009. Power of randomization in automata on infinite strings. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09). Lecture Notes in Computer Science, vol. 5710, Springer, 244--258. Google ScholarDigital Library
- Chatterjee, K., Doyen, L., and Henzinger, T. A. 2010. Qualitative analysis of partially-observable markov decision processes. In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS'10). Lecture Notes in Computer Science, vol. 6281, Springer, 258--269. Google ScholarDigital Library
- Chatterjee, K., Doyen, L., Henzinger, T. A., and Raskin, J.-F. 2006. Algorithms for omega-regular games with imperfect information. In Proceedings of the 20th International Workshop on Computer Science Logic (CSL'06). Lecture Notes in Computer Science, vol. 4207, Springer, 287--302. Google ScholarDigital Library
- Chatterjee, K., Doyen, L., Henzinger, T. A., and Raskin, J.-F. 2007. Algorithms for omega-regular games with imperfect information. Log. Meth. Comput. Sci. 3, 3.Google Scholar
- Chatterjee, K. and Henzinger, T. A. 2010. Probabilistic automata on infinite words: Decidability and undecidability results. In Proceedings of the 8th International Symposium on Automated Technology for Verification and Analysis (ATVA'10). Lecture Notes in Computer Science, vol. 6252, Springer, 1--16. Google ScholarDigital Library
- Chatzikokolakis, K. and Palamidessi, C. 2010. Making random choices invisible to the scheduler. Inf. Comput. 208, 6, 694--715. Google ScholarDigital Library
- Cheung, L., Lynch, N. A., Segala, R., and Vaandrager, F. W. 2006. Switched PIOA: Parallel composition via distributed scheduling. Theoret. Comput. Sci. 365, 1-2, 83--108. Google ScholarDigital Library
- Condon, A. 2001. Bounded error probabilistic finite state automata. In Handbook of Randomized Computing. Vol. II, Springer, 509--532.Google ScholarCross Ref
- Courcoubetis, C. and Yannakakis, M. 1995. The complexity of probabilistic verification. J. ACM 42, 4, 857--907. Google ScholarDigital Library
- de Alfaro, L. 1997. Formal verification of probabilistic systems. Ph.D. dissertation, Stanford University, Department of Computer Science.Google Scholar
- de Alfaro, L. 1998. Stochastic transition systems. In Proceedings of the 9th International Conference on Concurrency Theory (CONCUR'98). Lecture Notes in Computer Science, vol. 1466, Springer, 423--438. Google ScholarDigital Library
- de Alfaro, L. 1999. The verification of probabilistic systems under memoryless partial-information policies is hard. In Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification (ProbMiV'99). 19--32.Google Scholar
- Dwork, C. and Stockmeyer, L. 1990. A time-complexity gap for two-way probabilistic finite state automata. SIAM J. Comput. 19, 1011--1023. Google ScholarDigital Library
- Feller, W. 1950. An Introduction to Probability Theory and Its Applications. Wiley, New York.Google Scholar
- Freivalds, R. 1981. Probabilistic two-way machines. In Proceedings of the 10th International Symposium on Mathematical Foundations of Computer Science (MFCS'81). Lecture Notes in Computer Science, vol. 118, Springer, 33--45. Google ScholarDigital Library
- Gimbert, H. and Oualhadj, Y. 2010. Probabilistic automata on finite words: Decidable and undecidable problems. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10). Lecture Notes in Computer Science, vol. 6199, Springer, 527--538. Google ScholarDigital Library
- Giro, S. and D'Argenio, P. 2007. Quantitative model checking revisited: neither decidable nor approximable. In Proceedings of the 5th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'07). Lecture Notes in Computer Science, vol. 4763, Springer, 179--194. Google ScholarDigital Library
- Grädel, E., Thomas, W., and Wilke, T., Eds. 2002. Automata, Logics, and Infinite Games: A Guide to Current Research. Lecture Notes in Computer Science, vol. 2500, Springer.Google Scholar
- Gripon, V. and Serre, O. 2009. Qualitative concurrent stochastic games with imperfect information. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP'09). Lecture Notes in Computer Science, vol. 5556, Springer, 200--211. Google ScholarDigital Library
- Grösser, M. 2008. Reduction methods for probabilistic model checking. Ph.D. thesis, Technische Universität Dresden.Google Scholar
- Hart, S., Sharir, M., and Pnueli, A. 1983. Termination of probabilistic concurrent programs. ACM Trans. Prog. Lang. Syst. 5, 3, 356--380. Google ScholarDigital Library
- Kaelbling, L., Littman, M., and Cassandra, A. 1995. Partially observable markov decision processes for artificial intelligence. In Lecture Notes in Computer Science, vol. 981, Springer, 1--17. Google ScholarDigital Library
- Littman, M. 1996. Algorithms for sequential decision making. Ph.D. thesis, Brown University, Department of Computer Science. Google ScholarDigital Library
- Lovejoy, W. 1991. A survey of algorithmic methods for partially observable Markov decision processes. Ann. Oper. Res. 28, 1, 47--65. Google ScholarDigital Library
- Madani, O., Hanks, S., and Condon, A. 2003. On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell. 147, 1-2, 5--34. Google ScholarDigital Library
- Monahan, G. 1982. A survey of partially observable Markov decision processes: Theory, models, and algorithms. Manag. Sci. 28, 1, 1--16.Google ScholarDigital Library
- Papadimitriou, C. and Tsitsiklis, J. 1987. The complexity of Markov decision processes. Math. Oper. Res. 12, 3, 441--450. Google ScholarDigital Library
- Paz, A. 1966. Some aspects of probabilistic automata. Inf. Comput. 9, 1, 26--60.Google Scholar
- Paz, A. 1971. Introduction to Probabilistic Automata. Academic Press. Google ScholarDigital Library
- Perrin, D. and Pin, J.-E. 2004. Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol. 141, Elsevier.Google Scholar
- Pnueli, A. and Zuck, L. D. 1993. Probabilistic verification. Inf. Comput. 103, 1, 1--29. Google ScholarDigital Library
- Rabin, M. O. 1963. Probabilistic automata. Information and Control 6, 3, 230--245.Google ScholarCross Ref
- Reif, J. H. 1984. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci. 29, 2, 274--301.Google ScholarCross Ref
- Reisz, R. D. 1999a. A characterization theorem for probabilistic automata over infinite words. In Proceedings of the Symposium on 50 Years Jubilee of Mathematics Faculty, Timisoara. Analele Universitatii din Timisoara, seria Matematica-Informatica, vol. 37, 156--168.Google Scholar
- Reisz, R. D. 1999b. Decomposition theorems for probabilistic automata over infinite objects. Informatica, Lithuanian Acad. Sci. 10, 4, 427--440.Google Scholar
- Rosier, L. E. and Yen, H.-C. 1986. On the complexity of deciding fair termination of probabilistic concurrent finite-state programs. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP'86). Lecture Notes in Computer Science, vol. 226, Springer, 334--343. Google ScholarDigital Library
- Safra, S. 1988. On the complexity of ω-automata. In Proceedings of the 29th Symposium on Foundations of Computer Science (FOCS'88). IEEE Computer Society, 319--327. Google ScholarDigital Library
- Safra, S. and Vardi, M. Y. 1989. On ω-automata and temporal logic. In Proceedings of the 21st ACM Symposium on Theory of Computing (STOC'89). ACM, 127--137. Google ScholarDigital Library
- Segala, R. 1995. Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, Massachusetts Institute of Technology. Google ScholarDigital Library
- Sondik, E. J. 1971. The optimal control of partially observable Markov processes. Ph.D. thesis, Stanford University.Google Scholar
- Thomas, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science. Vol. B: Formal Models and Semantics. Elsevier Science, 133--191. Google ScholarDigital Library
- Thomas, W. 1997. Languages, automata, and logic. In Handbook of Formal Languages. Vol. 3: Beyond Words. Springer, 389--455. Google ScholarDigital Library
- van Glabbeek, R., Smolka, S., Steffen, B., and Tofts, C. 1990. Reactive, generative, and stratified models of probabilistic processes. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science (LICS'90). IEEE Computer Society, 130--141.Google Scholar
- Vardi, M. Y. 1985. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th Symposium on Foundations of Computer Science (FOCS'85). IEEE Computer Society, 327--338. Google ScholarDigital Library
- Vardi, M. Y. 1994. Nontraditional applications of automata theory. In Proceedings of International Conference on Theoretical Aspects of Computer Software (TACS'94). Lecture Notes in Computer Science, vol. 789, Springer, 575--597. Google ScholarDigital Library
- Vardi, M. Y. and Wolper, P. 1986. An automata-theoretic approach to automatic program verification. In Proceedings of the 1st IEEE Symposium on Logic in Computer Science (LICS'86). IEEE Computer Society, 332--345.Google Scholar
Index Terms
- Probabilistic ω-automata
Recommendations
On the Size of Unary Probabilistic and Nondeterministic Automata
Non-Classical Models of Automata and Applications IIWe investigate and compare the descriptional power of unary probabilistic and nondeterministic automata (pfa's and nfa's, respectively). We show the existence of a family of languages hard for pfa's in the following sense: For any positive integer d, ...
A power-set construction for reducing Büchi automata to non-determinism degree two
Buchi automata are finite automata that accept languages of infinitely long strings, so-called @w-languages. It is well known that, unlike in the finite-string case, deterministic and non-deterministic Buchi automata accept different @w-language classes,...
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer ScienceThe value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently. We sharpen this ...
Comments