We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its related class of stopwatch automata.
"Proceedings of 4th International Colloquium on Theoretical Aspects of Computation (ICTAC 2007)", Macau SAR, China, 26-28 September 2007, Springer Verlag Lecture Notes in Computer Science volume 4711, pages 185-200, 2007.