S. Almagor, O. Kupferman, J. O. Ringert, and Y. Velner, Quantitative assume guarantee synthesis, Proceedings of the 29th International Conference on Computer Aided Verification (CAV), pp.353-374, 2017.

S. Almagor, U. Boker, and O. Kupferman, Formally reasoning about quality, Journal of the ACM (JACM), vol.63, issue.3, p.56, 2016.
DOI : 10.1145/2875421

F. Bacchus and F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence, vol.116, issue.1-2, pp.123-191, 2000.
DOI : 10.1016/s0004-3702(99)00071-5

URL : https://doi.org/10.1016/s0004-3702(99)00071-5

J. A. Baier, F. Bacchus, and S. A. Mcilraith, A heuristic search approach to planning with temporally extended preferences, Artificial Intelligence, vol.173, issue.5-6, pp.593-618, 2009.
DOI : 10.1016/j.artint.2008.11.011

URL : https://doi.org/10.1016/j.artint.2008.11.011

R. Bloem, R. Ehlers, S. Jacobs, and R. Könighofer, How to handle assumptions in synthesis, Proceedings of the 3rd Workshop on Synthesis (SYNT), pp.34-50, 2014.
DOI : 10.4204/eptcs.157.7

URL : http://arxiv.org/pdf/1407.5395

A. Camacho, J. A. Baier, C. J. Muise, and S. A. Mcilraith, , 2018.

, Finite LTL synthesis as planning, Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS), pp.29-38

A. Camacho, J. A. Baier, C. J. Muise, and S. A. Mcilraith, Synthesizing controllers: On the correspondence between LTL synthesis and non-deterministic planning, Advances in Artificial Intelligence-Proceedings of the 31st Canadian Conference on Artificial Intelligence, pp.45-59, 2018.

A. Camacho, C. J. Muise, J. A. Baier, and S. A. Mcilraith, LTL realizability via safety and reachability games, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), pp.4683-4691, 2018.

K. Chatterjee and T. A. Henzinger, Assume-guarantee synthesis, Proceedings of the 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.261-275, 2007.

K. Chatterjee, T. A. Henzinger, and B. Jobstmann, Environment assumptions for synthesis, Proceedings of the 19th International Conference on Concurrency Theory (CONCUR), pp.147-161, 2008.

K. Chatterjee, T. Henzinger, and N. Piterman, Algorithms for Büchi games, GDV Workshop. Available on Arxiv, 2006.

A. Church, Applications of recursive arithmetic to the problem of circuit synthesis. Summaries of the Summer Institute of Symbolic Logic, Cornell University, vol.1, pp.3-50, 1957.

G. De-giacomo and M. Y. Vardi, Linear temporal logic and linear dynamic logic on finite traces, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI), pp.854-860, 2013.

G. De-giacomo and M. Y. Vardi, Synthesis for LTL and LDL on finite traces, Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI, pp.1558-1564, 2015.

D. Ippolito, N. Rodríguez, N. Sardiña, and S. , Fully observable non-deterministic planning as assumption-based reactive synthesis, Journal of Artificial Intelligence Research, vol.61, pp.593-621, 2018.

D. Fisman, O. Kupferman, and Y. Lustig, Rational synthesis, Proceedings of the 16th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp.190-204, 2010.

O. Kupferman and M. Y. Vardi, Model checking of safety properties, Formal Methods in System Design, vol.19, issue.3, pp.291-314, 2001.

O. Kupferman, On high-quality synthesis, Proceedings of the 11th International Computer Science Symposium in Russia, pp.1-15, 2016.

M. Lahijanian, S. Almagor, D. Fried, L. E. Kavraki, and M. Y. Vardi, This time the robot settles for a cost: A quantitative approach to temporal logic planning with partial satisfaction, Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI), pp.3664-3671, 2015.

A. Pnueli and R. Rosner, On the synthesis of a reactive module, Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages (POPL, pp.179-190, 1989.

A. Pnueli, The temporal logic of programs, Proceedings of the 18th IEEE Symposium on Foundations of Computer Science (FOCS), pp.46-57, 1977.

M. O. Rabin and D. S. Scott, Finite automata and their decision problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.

A. P. Sistla, Safety, liveness and fairness in temporal logic, Formal Aspects of Computing, vol.6, issue.5, pp.495-512, 1994.

S. Zhu, L. M. Tabajara, J. Li, G. Pu, and M. Y. Vardi, Symbolic LTLf synthesis, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI), pp.1362-1369, 2017.