conference paper published yes Krishnendu Chatterjee author 2E5DCA20-F248-11E8-B48F-1D18A9856A870000-0002-4561-241X Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000−0002−2985−7724 Barbara Jobstmann author Rohit Singh author KrCh department ToHe department CAV: Computer Aided Verification Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order is naturally expressed by a weighted automaton, which assigns to each word a value, such that a system is preferred if it generates a higher expected value. We solve the following optimal-synthesis problem: given an omega-regular specification, a Markov chain that describes the distribution of inputs, and a weighted automaton that measures how well a system satisfies the given specification tinder the given input assumption, synthesize a system that optimizes the measured value. For safety specifications and measures that are defined by mean-payoff automata, the optimal-synthesis problem amounts to finding a strategy in a Markov decision process (MDP) that is optimal for a long-run average reward objective, which can be done in polynomial time. For general omega-regular specifications, the solution rests on a new, polynomial-time algorithm for computing optimal strategies in MDPs with mean-payoff parity objectives. We present some experimental results showing optimal systems that were automatically generated in this way. Springer2010Edinburgh, United Kingdom eng 1004.073910.1007/978-3-642-14295-6_34 6174380 - 395 https://research-explorer.ista.ac.at/record/1856 Chatterjee, K., Henzinger, T. A., Jobstmann, B., &#38; Singh, R. (2010). Measuring and synthesizing systems in probabilistic environments (Vol. 6174, pp. 380–395). Presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom: Springer. <a href="https://doi.org/10.1007/978-3-642-14295-6_34">https://doi.org/10.1007/978-3-642-14295-6_34</a> Chatterjee K, Henzinger TA, Jobstmann B, Singh R. 2010. Measuring and synthesizing systems in probabilistic environments. CAV: Computer Aided Verification, LNCS, vol. 6174, 380–395. K. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, “Measuring and synthesizing systems in probabilistic environments,” presented at the CAV: Computer Aided Verification, Edinburgh, United Kingdom, 2010, vol. 6174, pp. 380–395. K. Chatterjee, T.A. Henzinger, B. Jobstmann, R. Singh, in:, Springer, 2010, pp. 380–395. Chatterjee, Krishnendu, Thomas A Henzinger, Barbara Jobstmann, and Rohit Singh. “Measuring and Synthesizing Systems in Probabilistic Environments,” 6174:380–95. Springer, 2010. <a href="https://doi.org/10.1007/978-3-642-14295-6_34">https://doi.org/10.1007/978-3-642-14295-6_34</a>. Chatterjee, Krishnendu, et al. <i>Measuring and Synthesizing Systems in Probabilistic Environments</i>. Vol. 6174, Springer, 2010, pp. 380–95, doi:<a href="https://doi.org/10.1007/978-3-642-14295-6_34">10.1007/978-3-642-14295-6_34</a>. Chatterjee K, Henzinger TA, Jobstmann B, Singh R. Measuring and synthesizing systems in probabilistic environments. In: Vol 6174. Springer; 2010:380-395. doi:<a href="https://doi.org/10.1007/978-3-642-14295-6_34">10.1007/978-3-642-14295-6_34</a> 38642018-12-11T12:05:35Z2025-09-23T09:33:01Z