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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.5461

R. Axelsson, M. Hague, S. Kreutzer, M. Lange, and M. Latte, Extended Computation Tree Logic, LPAR-17, pp.67-81, 2010.
DOI : 10.1007/978-3-642-16242-8_6
URL : http://arxiv.org/abs/1006.3709

P. Balbiani and E. Lorini, Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*, 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

E. M. Clarke and E. A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Logic of Programs 1981, pp.52-71, 1982.

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

D. Nicola, R. Vaandrager, and F. W. , Action versus state based logics for transition systems, LITP 1990, pp.407-419, 1990.
DOI : 10.1007/3-540-53479-2_17

E. A. Emerson and J. Halpern, "Sometimes" and "not never" revisited, Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '83, pp.151-178, 1986.
DOI : 10.1145/567067.567081

E. A. 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 : http://doi.org/10.1016/s0019-9958(84)80047-9

E. A. Emerson, Temporal and Modal Logic, Handbook of Theoretical Computer Science. Formal Models and Semantics, 1990.
DOI : 10.1016/B978-0-444-88074-1.50021-4

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

V. Goranko, Coalition games and alternating temporal logics, Proc. of TARK, pp.259-272, 2001.

D. Harel, Dynamic logic, Handbook of Philosophical Logic, pp.497-604, 1984.

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

A. Masini, L. Viganò, and M. Volpe, Labelled natural deduction for a bundled branching temporal logic, Journal of Logic and Computation, vol.21, issue.6, pp.1093-1163, 2011.
DOI : 10.1093/logcom/exq028

J. C. Mccabe-dansted, A Tableau for the Combination of CTL and BCTL, 2012 19th International Symposium on Temporal Representation and Reasoning, pp.29-36, 2012.
DOI : 10.1109/TIME.2012.17

I. Németi, Decidable versions of first order logic and cylindric-relativized set algebras, Logic Colloquium, pp.171-241, 1992.

H. Nishimura, Descriptively complete process logic, Acta Informatica, vol.14, issue.4, pp.359-369, 1980.
DOI : 10.1007/BF00286492

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. 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

C. Stirling, Modal and temporal logics, Handbook of Logic in Computer Science, 1992.

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 L. J. Stockmeyer, Improved upper and lower bounds for modal logics of programs, Proceedings of the seventeenth annual ACM symposium on Theory of computing , STOC '85, pp.240-251, 1985.
DOI : 10.1145/22145.22173

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

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