A. Bohy, V. Bruyère, E. Filiot, and J. Raskin, Synthesis from LTL Specifications with Mean-Payoff Objectives, TACAS, pp.169-184, 2013.
DOI : 10.1007/978-3-642-36742-7_12

URL : https://hal.archives-ouvertes.fr/hal-01196260

J. Brim, L. Chaloupka, R. Doyen, J. Gentilini, and . Raskin, Faster algorithms for meanpayoff games. Formal Methods in System Design, pp.97-118, 2011.
DOI : 10.1007/s10703-010-0105-x

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

. Rodric, . Bloem, . Krishnendu, T. A. Chatterjee, B. Henzinger et al., Better quality in synthesis through quantitative objectives, CAV, pp.140-156, 2009.

[. Bloem, K. Chatterjee, and B. Jobstmann, Handbook of Model Checking, chapter Graph games and reactive synthesis, 2014.

J. R. Burch, E. M. Clarke, K. L. Mcmillan, D. L. Dill, and L. J. Hwang, Symbolic model checking: 1020 States and beyond, Information and Computation, vol.98, issue.2, pp.142-170, 1992.
DOI : 10.1016/0890-5401(92)90017-A

URL : http://doi.org/10.1016/0890-5401(92)90017-a

K. Berwanger, M. Chatterjee, L. De-wulf, T. A. Doyen, and . Henzinger, Strategy construction for parity games with imperfect information, Information and Computation, vol.208, issue.10, pp.1206-1220, 2010.
DOI : 10.1016/j.ic.2009.09.006

URL : http://doi.org/10.1016/j.ic.2009.09.006

P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba, Infinite Runs in Weighted Timed Automata with Energy Constraints, Lecture Notes in Computer Science, vol.5215, pp.33-47, 2008.
DOI : 10.1007/978-3-540-85778-5_4

URL : https://hal.archives-ouvertes.fr/hal-01194594

[. Bruyère, E. Filiot, M. Randour, and J. Raskin, Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games, Information and Computation, vol.254, 2013.
DOI : 10.1016/j.ic.2016.10.011

[. Bloem, K. Greimel, T. A. Henzinger, and B. Jobstmann, Synthesizing robust systems, In FMCAD, pp.85-92, 2009.
DOI : 10.1109/fmcad.2009.5351139

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. [. Bertuccelli and . How, Robust Markov Decision Processes using Sigma Point sampling, 2008 American Control Conference, pp.5003-5008, 2008.
DOI : 10.1109/ACC.2008.4587287

. Baier, R. Boudewijn, H. Haverkort, J. Hermanns, and . Katoen, Model-checking algorithms for continuous-time markov chains, IEEE Transactions on Software Engineering, vol.29, issue.6, pp.524-541, 2003.
DOI : 10.1109/TSE.2003.1205180

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Bloem and B. Jobstmann, Nir Piterman, Amir Pnueli, and Yaniv Sa'ar. Synthesis of reactive(1) designs, J

C. Baier and J. Katoen, Principles of model checking, 2008.

L. [. Büchi and . Landweber, Solving sequential conditions by finite-state strategies. Transactions of the, pp.295-311, 1969.

E. Nels, A. V. Beckman, and . Nori, Probabilistic, modular and scalable inference of typestate specifications, PLDI, pp.211-221, 2011.

[. Ball, M. Naik, and S. K. Rajamani, From symptom to cause: localizing errors in counterexample traces, POPL, pp.97-105, 2003.

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.677-691, 1986.
DOI : 10.1109/TC.1986.1676819

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

[. Ciesinski, C. Baier, M. Größer, and J. Klein, Reduction Techniques for Model Checking Markov Decision Processes, 2008 Fifth International Conference on Quantitative Evaluation of Systems, pp.45-54
DOI : 10.1109/QEST.2008.45

[. Chatterjee and L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, MFCS, pp.206-218, 2011.
DOI : 10.1007/978-3-642-22993-0_21

URL : http://arxiv.org/abs/1104.2909

E. M. Clarke and E. Emerson, Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic, Logic of Programs, pp.52-71, 1981.

E. M. Clarke, O. Grumberg, K. L. Mcmillan, and X. Zhao, Efficient generation of counterexamples and witnesses in symbolic model checking, Proceedings of the 32nd ACM/IEEE conference on Design automation conference , DAC '95, pp.427-432, 1995.
DOI : 10.1145/217474.217565

K. Chatterjee, Markov Decision Processes with Multiple Long-Run Average Objectives, FSTTCS, pp.473-484, 2007.
DOI : 10.1007/978-3-540-77050-3_39

URL : http://arxiv.org/abs/1104.3489

[. Chatterjee, Graph games with reachability objectives -(invited talk), Lecture Notes in Computer Science, vol.6945, p.1
DOI : 10.1007/978-3-642-24288-5_1

[. Chatterjee, T. A. Henzinger, and M. Jurdzinski, Mean-Payoff Parity Games, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.178-187
DOI : 10.1109/LICS.2005.26

URL : https://hal.archives-ouvertes.fr/hal-01006391

[. Chatterjee, T. A. Henzinger, B. Jobstmann, and R. Singh, Measuring and Synthesizing Systems in Probabilistic Environments, Lecture Notes in Computer Science, vol.6174, pp.380-395, 2010.
DOI : 10.1007/978-3-642-14295-6_34

URL : http://arxiv.org/abs/1004.0739

K. Chang, I. L. Markov, and V. Bertacco, Fixing Design Errors With Counterexamples and Resynthesis, CMH06] Krishnendu Chatterjee STACS, pp.184-188, 2008.
DOI : 10.1109/TCAD.2007.907257

W. K. , C. , and M. K. Ng, Markov chains : models, algorithms and applications. International series in operations research & management science, 2006.

[. Chatterjee, M. Randour, and J. Raskin, Strategy synthesis for multi-dimensional quantitative objectives, 1201.
DOI : 10.1007/978-3-642-32940-1_10

URL : http://arxiv.org/abs/1201.5073

[. Chandra, E. Torlak, S. Barman, and R. Bodik, Angelic debugging, Proceeding of the 33rd international conference on Software engineering, ICSE '11, pp.121-130, 2011.
DOI : 10.1145/1985793.1985811

. Luca-de-alfaro, Formal Verification of Probabilistic Systems, 1997.

[. Daoui, M. Abbad, and M. Tkiouat, Exact Decomposition Approaches for Markov Decision Processes: A Survey, Advances in Operations Research, vol.6, issue.3, 2010.
DOI : 10.1016/S0004-3702(99)00052-1

[. Derman, On Sequential Decisions and Markov Chains, Management Science, vol.9, issue.1, pp.16-24, 1962.
DOI : 10.1287/mnsc.9.1.16

[. Drusinsky and D. Harel, On the power of bounded concurrency I: finite automata, Journal of the ACM, vol.41, issue.3, pp.517-539, 1994.
DOI : 10.1145/176584.176587

[. Dehnert, J. Katoen, and D. Parker, SMT-Based Bisimulation Minimisation of Markov Models, Lecture Notes in Computer Science, vol.7737, pp.28-47, 2013.
DOI : 10.1007/978-3-642-35873-9_5

[. Emerson and C. S. Jutla, The complexity of tree automata and logics of programs (extended abstract), FOCS, pp.328-337, 1988.

A. Ebnenasir, S. S. Kulkarni, and B. Bonakdarpour, Revising UNITY Programs: Possibilities and Limitations, OPODIS, pp.275-290, 2005.
DOI : 10.1145/940071.940116

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. [. Ehrenfeucht and . Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, vol.59, issue.2, pp.109-113, 1979.
DOI : 10.1007/BF01768705

P. Felli, G. D. Giacomo, and A. Lomuscio, Synthesizing agent protocols from ltl specifications against multiple partially-observable environments, 2012.

M. Z. Vojtech-forejt, G. Kwiatkowska, D. Norman, H. Parker, and . Qu, Quantitative Multi-objective Verification for Probabilistic Systems, Lecture Notes in Computer Science, vol.4, issue.4, pp.112-127, 2011.
DOI : 10.1007/978-3-642-12002-2_3

M. [. Forejt, D. Kwiatkowska, and . Parker, Pareto Curves for Probabilistic Model Checking, Proc. 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), pp.317-332, 2012.
DOI : 10.1007/978-3-642-33386-6_25

URL : http://arxiv.org/abs/1206.6295

[. Griesmayer, R. Bloem, and B. Cook, Repair of Boolean Programs with an Application to C, LNCS, vol.4144, pp.358-371, 2006.
DOI : 10.1007/11817963_33

[. Greimel, R. Bloem, B. Jobstmann, and M. Vardi, Open Implication, ICALP, pp.361-372, 2008.
DOI : 10.1007/978-3-540-70583-3_30

H. Gimbert, Pure Stationary Optimal Strategies in Markov Decision Processes, STACS'07, pp.200-211, 2007.
DOI : 10.1007/978-3-540-70918-3_18

URL : https://hal.archives-ouvertes.fr/hal-00140144

]. C. Gko-+-08, I. Grover, F. Knight, I. Okoro, G. Simmons et al., Automated emergency brake systems: Technical requirements, 2008.

A. Groce and W. Visser, What Went Wrong: Explaining Counterexamples, Lecture Notes in Computer Science, vol.2648, pp.121-135, 2003.
DOI : 10.1007/3-540-44829-2_8

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

[. Hahn, Model Checking Stochastic Hybrid Systems Doctoral dissertation, p.12, 2012.

R. Hav98-]-boudewijn and . Haverkort, Performance of computer communication systems -a model-based approach, 1998.

[. Hansson and B. Jonsson, A logic for reasoning about time and reliability, Formal Aspects of Computing, vol.2, issue.1, pp.102-111, 1994.
DOI : 10.1109/TSE.1986.6313045

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Gary, E. Hachtel, A. Macii, F. Pardo, and . Somenzi, Markovian analysis of large finite state machines, IEEE Trans. on CAD of Integrated Circuits and Systems, vol.15, issue.12, pp.1479-1493, 1996.

[. Jobstmann, A. Griesmayer, and R. Bloem, Program Repair as a Game, Kousha Etessami and Sriram K
DOI : 10.1007/11513988_23

A. [. Janjua and . Mycroft, Automatic correction to safety violations in programs, Thread Verification (TV'06), 2006.

C. Johnson, Final report: review of the BFU¨UberlingenBFU¨ BFU¨Uberlingen accident report Contract C/1.369, 2004.

H. Jin, K. Ravi, and F. Somenzi, Fate and free will in error traces, International Journal on Software Tools for Technology Transfer, vol.33, issue.2, pp.102-116, 2004.
DOI : 10.1145/587051.587053

[. Jobstmann, S. Staber, A. Griesmayer, and R. Bloem, Finding and fixing faults, Journal of Computer and System Sciences, vol.78, issue.2
DOI : 10.1016/j.jcss.2011.05.005

J. [. Julier and . Uhlmann, Unscented Filtering and Nonlinear Estimation, Proceedings of the IEEE, pp.401-422, 2004.
DOI : 10.1109/JPROC.2003.823141

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Mykel, J. P. Kochenderfer, and . Chryssanthacopoulos, Robust airborne collision avoidance through dynamic programming, 2011.

[. Kuchar, C. Ann, and . Drumm, The traffic alert and collision avoidance system, p.277, 2007.

[. Kress-gazit, G. E. Fainekos, and G. J. Pappas, Temporal-Logic-Based Reactive Mission and Motion Planning, IEEE Transactions on Robotics, vol.25, issue.6, pp.1370-1381, 2009.
DOI : 10.1109/TRO.2009.2030225

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

[. Kattenbelt, M. Z. Kwiatkowska, G. Norman, and D. Parker, A game-based abstraction-refinement framework for markov decision processes. Formal Methods in System Design, pp.246-280, 2010.

H. Kim, E. R. Li, N. Dougherty, Y. Cao, M. Chen et al., CAN MARKOV CHAIN MODELS MIMIC BIOLOGICAL REGULATION?, Journal of Biological Systems, vol.10, issue.04, 2002.
DOI : 10.1016/S1535-6108(02)00045-4

[. Khasidashvili, J. Moondanos, D. Kaiss, and Z. Hanna, An enhanced cut-points algorithm in formal equivalence verification, Sixth IEEE International High-Level Design Validation and Test Workshop, pp.171-176, 2001.
DOI : 10.1109/HLDVT.2001.972825

M. Z. Kwiatkowska, G. Norman, and D. Parker, Probabilistic symbolic model checking with prism: A hybrid approach

M. Z. Kwiatkowska, G. Norman, and D. Parker, Stochastic Model Checking, SFM, pp.220-270, 2007.
DOI : 10.1007/978-3-540-72522-0_6

G. [. Kwiatkowska, D. Norman, and . Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, CAV, pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17

URL : https://hal.archives-ouvertes.fr/hal-00648035

J. Sproston, Performance analysis of probabilistic timed automata using digital clocks, Formal Methods in System Design, vol.29, issue.1, pp.33-78, 2006.

Z. Marta, D. Kwiatkowska, and . Parker, Automated verification and strategy synthesis for probabilistic systems, Lecture Notes in Computer Science, vol.8172, pp.5-22, 2013.

[. Kaiss, M. Skaba, Z. Hanna, and Z. Khasidashvili, Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification, Formal Methods in Computer Aided Design (FMCAD'07), pp.20-26, 2007.
DOI : 10.1109/FAMCAD.2007.37

I. S. Joost-pieter-katoen, E. Zapreev, H. Moritz-hahn, D. N. Hermanns, and . Jansen, The ins and outs of the probabilistic model checker MRMC, Performance Evaluation, vol.68, issue.2, pp.90-104, 2011.
DOI : 10.1016/j.peva.2010.04.001

S. [. Lahijanian, C. Andersson, and . Belta, Control of Markov decision processes from PCTL specifications, Proceedings of the 2011 American Control Conference, pp.311-316, 2011.
DOI : 10.1109/ACC.2011.5990952

[. Lichtenstein and A. Pnueli, Checking that finite state concurrent programs satisfy their linear specification, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '85, pp.97-107, 1985.
DOI : 10.1145/318593.318622

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Daniel, M. O. Lehmann, and . Rabin, On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem, POPL, pp.133-138, 1981.

R. Mcnaughton, Infinite games played on finite graphs, Annals of Pure and Applied Logic, vol.65, issue.2
DOI : 10.1016/0168-0072(93)90036-D

[. Mayer, C. Limongelli, A. Orlandini, and V. Poggioni, Linear temporal logic as an executable semantics for planning languages, Journal of Logic, Language and Information, vol.6, issue.3?4, pp.63-89, 2007.
DOI : 10.1007/s10849-006-9022-1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

]. J. Nor03 and . Norris, Markov Chains, 2003.

D. Npk-+-05-]-gethin-norman, M. Z. Parker, S. K. Kwiatkowska, R. Shukla, and . Gupta, Using probabilistic model checking for dynamic power management, Formal Aspects of Computing, vol.17, issue.2, pp.160-176, 2005.
DOI : 10.1007/s00165-005-0062-0

V. Aditya, S. K. Nori, and . Rajamani, Program analysis and machine learning: A win-win deal, Lecture Notes in Computer Science, vol.7078, pp.1-2, 2011.

[. Piterman, From nondeterministic büchi and streett automata to deterministic parity automata, Logical Methods in Computer Science, vol.3, issue.3, 2007.
DOI : 10.1109/lics.2006.28

URL : http://arxiv.org/abs/0705.2205

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

A. Pnueli and R. Rosner, On the synthesis of a reactive module, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.179-190, 1989.
DOI : 10.1145/75277.75293

R. Parr and S. J. Russell, Reinforcement learning with hierarchies of machines, 1997.

L. Martin and . Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, 1994.

[. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

]. M. Rab69 and . Rabin, Decidability of second-order theories and automata on infinite trees. Transactions of the, pp.1-35, 1969.

O. Michael and . Rabin, N-process mutual exclusion with bounded waiting by 4 log 2 n-valued shared variable, J. Comput. Syst

J. Stuart, P. Russell, and . Norvig, Artificial Intelligence -A Modern Approach (3. internat, 2010.

R. Rosner, Modular Synthesis of Reactive Systems, 1997.

[. Renieris and S. P. Reiss, Fault localization with nearest neighbor queries, 18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings., pp.30-39, 2003.
DOI : 10.1109/ASE.2003.1240292

[. Ravi and F. Somenzi, Minimal Assignments for Bounded Model Checking, TACAS, pp.31-45, 2004.
DOI : 10.1007/978-3-540-24730-2_3

[. Rennen, E. R. Van-dam, and D. Hertog, Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets, INFORMS Journal on Computing, vol.23, issue.4, pp.493-517, 2011.
DOI : 10.1287/ijoc.1100.0419

S. Schewe, Tighter bounds for the determinisation of büchi automata, FOSSACS, pp.167-181, 2009.

[. Samanta, J. V. Deshmukh, and E. Emerson, Automatic Generation of Local Repairs for Boolean Programs, 2008 Formal Methods in Computer-Aided Design
DOI : 10.1109/FMCAD.2008.ECP.31

]. L. Sha53 and . Shapley, Stochastic Games, Proceedings of the National Academy of Sciences of the United States of America, vol.39, issue.10, pp.1095-1100, 1953.

A. Solar-lezama, R. M. Rabbah, R. Bodík, and K. Ebcioglu, Programming by sketching for bit-streaming programs, PLDI, pp.281-294, 2005.
DOI : 10.1145/1064978.1065045

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

A. V. Sharma, A. Nori, and . Aiken, Interpolants as Classifiers, Lecture Notes in Computer Science, vol.7358, pp.71-87
DOI : 10.1007/978-3-642-31424-7_11

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. S. Sutton, Generalization in reinforcement learning: Successful examples using sparse coarse coding, NIPS, pp.1038-1044, 1995.

]. H. Tij03 and . Tijms, A First Course in Stochastic Models, 2003.

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

. Vcd-+-12-]-yaron, K. Velner, L. Chatterjee, T. A. Doyen, A. Henzinger et al., The complexity of multi-mean-payoff and multi-energy games, 1209.

A. Vahidi and A. Eskandarian, Research advances in intelligent collision avoidance and adaptive cruise control. Intelligent Transportation Systems, IEEE Transactions on, vol.4, issue.3, pp.143-153, 2003.
DOI : 10.1109/tits.2003.821292

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

D. Christian-von-essen and . Giannakopoulou, Analyzing the next generation airborne collision avoidance system, International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2014.

B. Christian-von-essen and . Jobstmann, Synthesizing systems with optimal average-case behavior for ratio objectives

B. Christian-von-essen and . Jobstmann, Synthesizing Efficient Controllers, VMCAI, pp.428-444, 2012.
DOI : 10.1016/0304-3975(95)00188-3

B. Christian-von-essen and . Jobstmann, Program Repair without Regret, Lecture Notes in Computer Science, vol.8044, pp.896-911, 2013.
DOI : 10.1007/978-3-642-39799-8_64

[. Vechev, E. Yahav, and G. Yorsh, Inferring Synchronization under Limited Observability, TACAS'09, pp.139-154, 2009.
DOI : 10.1145/1095408.1095421

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. Martin, E. Vechev, G. Yahav, and . Yorsh, Abstractionguided synthesis of synchronization, POPL, pp.327-338, 2010.

E. Oliver and . Theel, Symblicit calculation of long-run averages for concurrent probabilistic systems, In QEST, pp.27-36, 2010.

[. Wimmer, S. Derisavi, and H. Hermanns, Symbolic Partition Refinement with Dynamic Balancing of Time and Space, 2008 Fifth International Conference on Quantitative Evaluation of Systems
DOI : 10.1109/QEST.2008.14

[. Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata
DOI : 10.1007/11817963_5

]. D. Whi93 and . White, A survey of applications of markov decision processes, The Journal of the Operational Research Society, vol.44, issue.11, pp.1073-1096, 1993.

P. Wolper, M. Y. Vardi, and A. P. Sistla, Reasoning about infinite computation paths (extended abstract), FOCS, pp.185-194, 1983.
DOI : 10.1109/sfcs.1983.51

H. Yue, H. C. Bohnenkamp, and J. Katoen, Analyzing Energy Consumption in a Gossiping MAC Protocol, Lecture Notes in Computer Science, vol.5987, pp.107-119, 2010.
DOI : 10.1007/978-3-642-12104-3_10

A. Zeller and R. Hildebrandt, Simplifying and isolating failure-inducing input, IEEE Transactions on Software Engineering, vol.28, issue.2, pp.183-200, 2002.
DOI : 10.1109/32.988498

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3

[. Zuliani, A. Platzer, and E. M. Clarke, Bayesian statistical model checking with application to stateflow/simulink verification. Formal Methods in System Design, pp.338-367, 2013.