A simplification of the untiming procedure for timed automata defining languages of finite strings
Michael R. Laurence, Michael P. Spathopoulos · 1997
Given an Alur Timed Automaton G accepting the language LT, as defined in [1], a finite state machine G can be constructed, which accepts the language Untime(LT). G is known as the region automaton. Here we construct an alternative finite state machine G ∗ that also accepts the language Untime(LT), but has significantly fewer states than G. The new untiming procedure involves finite timed words only.