In the last years, model checking with interval temporal logics is emerging as a viable alternative to model checking with standard point-based temporal logics, such as LTL, CTL, CTL * , and the like. The behavior of the system is modelled by means of (finite) Kripke structures, as usual. However, while temporal logics which are interpreted "point-wise" describe how the system evolves state-by-state, and predicate properties of system states, those which are interpreted "interval-wise" express properties of computation stretches, spanning a sequence of states. A proposition letter is assumed to hold over a computation stretch (interval) if and only if it holds over each component state (homogeneity assumption). A natural question arises: is there any advantage in replacing points by intervals as the primary temporal entities, or is it just a matter of taste?In this paper, we study the expressiveness of Halpern and Shoham's interval temporal logic (HS) in model checking, in comparison with those of LTL, CTL, and CTL * . To this end, we consider three semantic variants of HS: the state-based one, introduced by Montanari et al. in [34,30], that allows time to branch both in the past and in the future, the computationtree-based one, that allows time to branch in the future only, and the trace-based variant, that disallows time to branch. These variants are compared among themselves and to the aforementioned standard logics, getting a complete picture. In particular, we show that HS with trace-based semantics is equivalent to LTL (but at least exponentially more succinct), HS with computation-tree-based semantics is equivalent to finitary CTL * , and HS with state-based semantics is incomparable with all of them (LTL, CTL, and CTL * ). The work has been supported by the GNCS project Formal Methods for Verification and Synthesis of Discrete and Hybrid Systems. The work by A. Molinari and A. Montanari has also been supported by the project (PRID) ENCASE -Efforts in the uNderstanding of Complex interActing SystEms. * This work is an extended and revised version of [8].Structure of the paper. In Section 2, we introduce basic notation and preliminary notions. In Subsection 2.1 we define Kripke structures and interval structures, in Subsection 2.2 we recall the well-known PTLs LTL, CTL, and CTL * , and in Subsection 2.3 we present the interval temporal logic HS. Then, in Subsection 2.4 we define the three semantic variants of HS (HS st , HS ct , and HS lin ). Finally, in Subsection 2.5 we provide a detailed example which gives an intuitive account of the three semantic variants and highlights their differences. In the next three sections, we analyze and compare their expressiveness. In Section 3 we show the expressive equivalence of LTL and HS lin . Then, in Section 4 we prove the expressive equivalence of HS ct and finitary CTL * . Finally, in Section 5 we compare the expressiveness of HS st , HS ct , and HS lin . Conclusions summarize the work done and outline some directions for future research.0 ), where the set of node...