Abstract
We introduce probabilistic ω-regular expressions which are an extension to classical regular expressions with semantics taking probabilities into account. The main result states that probabilistic ω-regular expressions are expressively equivalent to probabilistic Muller-automata. To obtain better decidability properties we introduce a subclass of our expressions with decidable emptiness and approximation problem.
Keywords
- Regular Language
- Strongly Connect Component
- Probabilistic Automaton
- Main Result State
- Undecidability Result
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baier, C., Grösser, M.: Recognizing ω-regular languages with probabilistic automata. In: Proc. LICS, pp. 137–146. IEEE (2005)
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)
Bollig, B., Gastin, P., Monmege, B., Zeitoun, M.: A probabilistic kleene theorem. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 400–415. Springer, Heidelberg (2012)
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Int. Congress for Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)
Chadha, R., Sistla, A.P., Viswanathan, M.: Power of randomization in automata on infinite strings. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 229–243. Springer, Heidelberg (2009)
Chadha, R., Sistla, A.P., Viswanathan, M.: Probabilistic büchi automata with non-extremal acceptance thresholds. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 103–117. Springer, Heidelberg (2011)
Chatterjee, K., Doyen, L., Henzinger, T.A.: Probabilistic weighted automata. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 244–258. Springer, Heidelberg (2009)
Chatterjee, K., Henzinger, T.: Probabilistic automata on infinite words: Decidability and undecidability results. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 1–16. Springer, Heidelberg (2010)
Chatterjee, K., Tracol, M.: Decidable problems for probabilistic automata on infinite words. In: LICS, pp. 185–194. IEEE Computer Society (2012)
Cheung, L., Lynch, N., Segala, R., Vaandrager, F.: Switched PIOA: Parallel composition via distributed scheduling. TCS 365(1-2), 83–108 (2006)
Ésik, Z., Kuich, W.: Finite automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. EATCS Monographs, pp. 69–104. Springer (2009)
Fijalkow, N., Gimbert, H., Oualhadj, Y.: Deciding the value 1 problem for probabilistic leaktight automata. In: LICS, pp. 295–304. IEEE Computer Society (2012)
Giammarresi, D., Montalbano, R.: Deterministic generalized automata. TCS 215(1-22), 191–208 (1999)
Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, Mccarthy (eds.) Automata Studies, pp. 3–41. Princeton Univ. Press (1956)
Klenke, A.: Probability Theory: A Comprehensive Course. Springer (December 2007)
Kuich, W., Rahonis, G.: Fuzzy regular languages over finite and infinite words. Fuzzy Sets and Systems 157(11), 1532–1549 (2006)
Madani, O., Hanks, S., Condon, A.: On the undecidability of probabilistic planning and related stochastic optimization problems. Artif. Intell. 147(1-2), 5–34 (2003)
Mora-Lpez, L., Morales, R., Sidrach de Cardona, M., Triguero, F.: Probabilistic finite automata and randomness in nature: a new approach in the modelling and prediction of climatic parameters. In: Proc. International Environmental Modelling and Software Congress, pp. 78–83 (2002)
Rabin, M.: Probabilistic automata. Information and Control 6(3), 230–245 (1963)
Ron, D., Singer, Y., Tishby, N.: The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning 25, 117–149 (1996)
Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4(2-3), 245–270 (1961)
Tracol, M., Baier, C., Größer, M.: Recurrence and transience for probabilistic automata. In: FSTTCS, vol. 4, pp. 395–406. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)
Vardi, M.Y.: Automatic verification of probabilistic concurrent finite state programs. In: Foundations of Computer Science, pp. 327–338 (1985)
Weidner, T.: Probabilistic automata and probabilistic logic. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 813–824. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Weidner, T. (2014). Probabilistic ω-Regular Expressions. In: Dediu, AH., Martín-Vide, C., Sierra-Rodríguez, JL., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2014. Lecture Notes in Computer Science, vol 8370. Springer, Cham. https://doi.org/10.1007/978-3-319-04921-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-319-04921-2_48
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-04920-5
Online ISBN: 978-3-319-04921-2
eBook Packages: Computer ScienceComputer Science (R0)