Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions

• Authors: P. Vijay Suman;Paritosh K. Pandya
• Venue: LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
• Year: 2009

*** -IRTA are a subclass of timed automata with *** moves (*** -TA). They are useful for modelling global sparse time base used in time-triggered architecture and distributed business processes. In a previous paper [1], the language inclusion problem $L({\mathcal A}) \subseteq L(\mathcal B$ was shown to be decidable when $\mathcal A$ is an *** -TA and $\mathcal B$ is an *** -IRTA. In this paper, we address the determinization, complementation and *** -removal questions for *** -IRTA. We introduce a new variant of timed automata called GRTA. We show that for every *** -IRTA we can effectively construct a language equivalent 1-clock, deterministic GRTA with periodic time guards (but having no *** moves). The construction gives rise to at most a double exponential blowup in the number of locations. Finally, we show that every GRTA with periodic guards can be reduced to a language equivalent *** -IRTA with at most double the number of locations. Thus, *** -IRTA, periodic GRTA, and deterministic 1-clock periodic GRTA have the same expressive power and that they are all expressively complete with respect to the regular *** $\checkmark$-languages. Equivalence of deterministic and nondeterministic automata also gives us that these automata are closed under the boolean operations.