Interval algebra of Allen [Allen:1983] propose a set of relations which is particularly interesting on historical annotating tasks [Accary:2004] . However, finding the feasible relations and consistent scenario has been shown to be NP-complete tasks for interval algebra networks [Vilain:1986,Vilain:1989]. For point algebra networks and a restricted class of interval algebra networks, some works propose efficient algorithms to resolve it. Nevertheless, these sets of relations (made of basic relation disjunctions) are not intuitive for describing historical scenarios. In this paper we propose a set of concrete relations for the annotator, and we formalize it in terms of temporal algebras. We then describe how our model can be matched with other ones to merge calculation efficiency and information suitability.