article published yes Krishnendu Chatterjee author 2E5DCA20-F248-11E8-B48F-1D18A9856A870000-0002-4561-241X Laurent Doyen author Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000−0002−2985−7724 KrCh department ToHe department Design for Embedded Systems project COMponent-Based Embedded Systems design Techniques project Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the maximum, limsup, liminf, limit-average, or discounted-sum of the transition weights. The value of a word w is the supremum of the values of the runs over w. We study expressiveness and closure questions about these quantitative languages. We first show that the set of words with value greater than a threshold can be omega-regular for deterministic limit-average and discounted-sum automata, while this set is always omega-regular when the threshold is isolated (i.e., some neighborhood around the threshold contains no word). In the latter case, we prove that the omega-regular language is robust against small perturbations of the transition weights. We next consider automata with transition weights 0 or 1 and show that they are as expressive as general weighted automata in the limit-average case, but not in the discounted-sum case. Third, for quantitative languages L-1 and L-2, we consider the operations max(L-1, L-2), min(L-1, L-2), and 1 - L-1, which generalize the boolean operations on languages, as well as the sum L-1 + L-2. We establish the closure properties of all classes of quantitative languages with respect to these four operations. https://research-explorer.ista.ac.at/download/3867/5312/IST-2012-55-v1+1_Expressiveness_Closure_Properties_Quantitative_Languages.pdf application/pdfno https://research-explorer.ista.ac.at/download/3867/5313/IST-2016-55-v2+1_1007.4018.pdf application/pdfno https://creativecommons.org/licenses/by-nd/4.0/ International Federation for Computational Logic2010 eng 00028265350001010.2168/LMCS-6(3:10)2010 631 - 23 https://research-explorer.ista.ac.at/record/4540 Chatterjee K, Doyen L, Henzinger TA. Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. 2010;6(3):1-23. doi:<a href="https://doi.org/10.2168/LMCS-6(3:10)2010">10.2168/LMCS-6(3:10)2010</a> Chatterjee, Krishnendu, Laurent Doyen, and Thomas A Henzinger. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic, 2010. <a href="https://doi.org/10.2168/LMCS-6(3:10)2010">https://doi.org/10.2168/LMCS-6(3:10)2010</a>. Chatterjee, K., Doyen, L., &#38; Henzinger, T. A. (2010). Expressiveness and closure properties for quantitative languages. <i>Logical Methods in Computer Science</i>. International Federation for Computational Logic. <a href="https://doi.org/10.2168/LMCS-6(3:10)2010">https://doi.org/10.2168/LMCS-6(3:10)2010</a> K. Chatterjee, L. Doyen, T.A. Henzinger, Logical Methods in Computer Science 6 (2010) 1–23. Chatterjee K, Doyen L, Henzinger TA. 2010. Expressiveness and closure properties for quantitative languages. Logical Methods in Computer Science. 6(3), 1–23. K. Chatterjee, L. Doyen, and T. A. Henzinger, “Expressiveness and closure properties for quantitative languages,” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3. International Federation for Computational Logic, pp. 1–23, 2010. Chatterjee, Krishnendu, et al. “Expressiveness and Closure Properties for Quantitative Languages.” <i>Logical Methods in Computer Science</i>, vol. 6, no. 3, International Federation for Computational Logic, 2010, pp. 1–23, doi:<a href="https://doi.org/10.2168/LMCS-6(3:10)2010">10.2168/LMCS-6(3:10)2010</a>. 38672018-12-11T12:05:36Z2026-07-06T13:24:40Z