State-Based Control of Timed Discrete-Event Systems

The problem of supervisor synthesis for discrete-event systems (DES) has been proven to be NP-hard. Nevertheless, state tree structures (STS) have turned out to be a computationally efficient framework to design supervisors for very large-scale systems. But this framework relies on a state-based control theory. To expand STS to timed systems, known as timed discrete-event systems (TDES), a state-based control theory for TDES is required. In this paper, such a theory will be introduced and it will be proven that this approach is indeed equivalent to the existing language-based control theory for TDES.