  In this paper, we present the first general solution to the automatic
reconfiguration problem of timed discrete-event systems. We extend the
recursive forcible backtracking approach which had been already solved the
automatic reconfiguration problem of untimed discrete-event systems. In
particular, we first solve the timed centralized reconfiguration problem using
a specific timed eligibility set. Then, we study the identity between the
solutions to an arbitrary timed centralized reconfiguration problem and its
corresponding decentralized version. It turns out that the solutions to both
cases are identical to each other. So, the solution obtained by the proposed
theory is interestingly invariant to systematic distributions.
