The relationship between two well established formalisms for temporal reasoning is first investigated, namely between Allen’s interval algebra (or Allen’s temporal logic, abbreviated ) and linear temporal logic ( ). A discrete variant of is defined, called Allen linear temporal logic ( ), whose models are ω-sequences of timepoints. It is shown that any formula can be linearly translated into an equivalent formula, thus enabling the use of techniques on requirements. This translation also implies the NP-completeness of satisfiability. Then the problem of monitoring requirements is investigated, showing that it reduces to checking satisfiability; the similar problem for unrestricted is known to require exponential space. An effective monitoring algorithm for is given, which has been implemented and experimented with in the context of planning applications.