R. Bloem, S. Galler, B. Jobstmann, N. Piterman, A. Pnueli et al., Specify, Compile, Run: Hardware from PSL, Electronic Notes in Theoretical Computer Science, vol.190, issue.4, pp.3-16, 2007.
DOI : 10.1016/j.entcs.2007.09.004

URL : http://doi.org/10.1016/j.entcs.2007.09.004

F. Cassez, A. David, E. Fleury, K. G. Larsen, and D. Lime, Efficient On-the-Fly Algorithms for the Analysis of Timed Games, In CONCUR LNCS, vol.3653, pp.66-80, 2005.
DOI : 10.1007/11539452_9

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

D. Wulf, M. Doyen, L. Henzinger, T. A. Raskin, and J. F. , Antichains: A New Algorithm for Checking Universality of Finite Automata, CAV, pp.17-30, 2006.
DOI : 10.1007/11817963_5

L. Doyen and J. F. Raskin, Improved algorithms for the automata-based approach to modelchecking, TACAS, pp.451-465, 2007.

E. Filiot, N. Jin, and J. Raskin, An Antichain Algorithm for LTL Realizability, CAV, pp.263-277, 2009.
DOI : 10.1007/978-3-642-02658-4_22

URL : https://hal.archives-ouvertes.fr/inria-00489952

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

B. Jobstmann and R. Bloem, Optimizations for LTL Synthesis, 2006 Formal Methods in Computer Aided Design, pp.117-124
DOI : 10.1109/FMCAD.2006.22

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

W. Kuijper and J. Van, Compositional Control Synthesis for Partially Observable Systems, In CONCUR LNCS, vol.77, issue.1, pp.431-447, 2009.
DOI : 10.1007/11730637_14

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

O. Kupferman and M. Y. Vardi, Safraless Decision Procedures, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.531-542, 2005.
DOI : 10.1109/SFCS.2005.66

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

O. Kupferman, N. Piterman, and M. Y. Vardi, Safraless Compositional Synthesis, CAV, pp.31-44, 2006.
DOI : 10.1007/11817963_6

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

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. Rosner, Modular synthesis of reactive systems, Weizmann Institute of Science, 1992.

S. Safra, On the complexity of omega -automata, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.319-327, 1988.
DOI : 10.1109/SFCS.1988.21948

S. Schewe and B. Finkbeiner, Bounded Synthesis, ATVA, pp.474-488, 2007.
DOI : 10.1007/978-3-540-75596-8_33

S. Sohail and F. Somenzi, Safety first: A two-stage algorithm for LTL games, 2009 Formal Methods in Computer-Aided Design, pp.77-84, 2009.
DOI : 10.1109/FMCAD.2009.5351138

W. Thomas, Church???s Problem and a Tour through Automata Theory, Pillars of Computer Science, pp.635-655, 2008.
DOI : 10.1007/978-3-540-78127-1_35

M. Y. Vardi, An automata-theoretic approach to linear temporal logic, Banff Higher Order Workshop, pp.238-266, 1995.
DOI : 10.1007/3-540-60915-6_6

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