This paper introduces the model of linearly priced timed au-
tomata as an extension of timed automata with prices on both transitions
and locations. For this model we consider the minimum-cost reachabil-
ity problem: i.e. given a linearly priced timed automaton and a target
state, determine the minimum cost of executions from the initial state to
the target state. This problem generalizes the minimum-time reachabil-
ity problem for ordinary timed automata to more general optimization
problems like static scheduling problems. We prove decidability of this
problem by oering an algorithmic solution, which isbased on a com-
bination of branch-and-bound techniques and a new notion of priced
regions. The latter allows symbolic representation and manipulation of
reachable states together with the cost of reaching them.