A New Method for Transforming Timed Automata

Discrete events systems (DES) are defined by the sequences of events they can execute. For example, communication protocols and computer networks can be seen as DES. Finite state automata (FSA) are convenient for studying (i.e., analyzing, designing) DES, and timed automata (TA) are convenient for describing real-time DES. An approach for studying a real-time DES, has been to transform a TA describing the real-time DES into an equivalent FSA, and then to study the latter. We propose here a new transformation method of TA into FSA. The method is well suited for conformance testing and supervisory control of real-time DES.