Duration Calculus with Iteration (DC*) has been used as an interface between original Duration Calculus and Timed Automata, but has not been studied rigorously. In this paper, we study a subset of DC* formulas consisting of so-called simple ones which corresponds precisely with the class of Timed Automata. We give a complete proof system and the decidability results for the subset.