R. Alur, T. Henzinger, and O. Kupferman, Alternating-time temporal logic, Journal of the ACM, vol.49, issue.5, pp.672-713, 2002.
DOI : 10.1145/585265.585270
URL : http://www-cad.eecs.berkeley.edu/~tah/Publications/alternating-time_temporal_logic.ps

P. Balbiani and E. Lorini, Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*, WoLLIC 2013, pp.251-26510, 2013.
DOI : 10.1007/978-3-642-39992-3_22
URL : https://hal.archives-ouvertes.fr/hal-01212936

N. Belnap, M. Perloff, and M. Xu, Facing the Future: Agents and Choices in Our Indeterminist World, 2001.

M. Brown and V. Goranko, An extended branching-time Ockhamist temporal logic, Journal of Logic, Language and Information, vol.8, issue.2, pp.143-166, 1999.
DOI : 10.1023/A:1008398102653

M. Dam, CTL??? and ECTL??? as fragments of the modal ??-calculus, Theoretical Computer Science, vol.126, issue.1, pp.77-96, 1994.
DOI : 10.1016/0304-3975(94)90269-0

A. David and S. Schewe, Deciding ATL * satisfiability by tableaux, 2016.
DOI : 10.1007/978-3-319-21401-6_14
URL : https://hal.archives-ouvertes.fr/hal-01367780

E. Emerson and A. Sistla, Deciding full branching time logic, Information and Control, vol.61, issue.3, pp.175-201, 1984.
DOI : 10.1016/S0019-9958(84)80047-9
URL : https://doi.org/10.1016/s0019-9958(84)80047-9

E. A. Emerson and C. S. Jutla, The Complexity of Tree Automata and Logics of Programs, SIAM Journal on Computing, vol.29, issue.1, pp.132-158, 1999.
DOI : 10.1137/S0097539793304741

M. J. Fischer and R. E. Ladner, Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979.
DOI : 10.1016/0022-0000(79)90046-1

D. Harel, D. Kozen, and J. Tiuryn, Dynamic Logic, 2000.

N. Piterman, From nondeterministic Büchi and Streett automata to deterministic parity automata, Logic in Computer Science (LICS), pp.255-264, 2006.
DOI : 10.1109/lics.2006.28
URL : http://arxiv.org/pdf/0705.2205

V. R. Pratt, Models of program logics, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.115-122, 1979.
DOI : 10.1109/SFCS.1979.24

A. Prior, Past, Present, and Future, 1967.
DOI : 10.1093/acprof:oso/9780198243113.001.0001

M. Reynolds, Abstract, The Journal of Symbolic Logic, vol.61, issue.03, pp.1011-1057, 2001.
DOI : 10.1007/BF00649485
URL : https://hal.archives-ouvertes.fr/hal-01388984

M. Reynolds, A Tableau for Bundled CTL, Journal of Logic and Computation, vol.17, issue.1, pp.117-132, 2007.
DOI : 10.1093/logcom/exl033

R. S. Streett, Propositional dynamic logic of looping and converse is elementarily decidable, Information and Control, vol.54, issue.1-2, pp.121-141, 1982.
DOI : 10.1016/S0019-9958(82)91258-X

R. Thomason, Combinations of tense and modality, Handbook of Philosophical Logic, pp.135-165, 1984.

M. Y. Vardi and P. Wolper, Yet another process logic (preliminary version), Logic of Programs 1983, pp.501-51210, 1984.
DOI : 10.1007/3-540-12896-4_383
URL : http://orbi.ulg.ac.be/bitstream/2268/196904/1/VW%20lop83.pdf

P. Wolper, A translation from full branching time temporal logic to one letter propositional dynamic logic with looping

A. Zanardo, Abstract, The Journal of Symbolic Logic, vol.37, issue.01, pp.143-166, 1996.
DOI : 10.1007/BF00414289