A cellular automaton (CA) is called reversible (or injective) iff its global function is one-to-one. It has been shown by Toffoli that any (irreversible) k-dimensional CA is simulated by a k + 1-dimensional RCA. In this paper, we show that any one-dimensional CA with finite configurations can be simulated by a one-dimensional reversible CA. This is proved by using the framework of partitioned CA (PCA).