Author :

Laboratoire de l'informatique du parallélismeDurand-Lose, Jérôme

Abstract :

(eng) In this paper, we consider timed automata for piecewise constant signals.In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during all the duration of the transition. Signal automata are very different from un-timed and time-event automata because piecewise constant signals may be split (and spliced) in an infinite number of ways. We show that there exist signal regular expressions with renaming describing exactly the languages accepted by signal automata. The constructions show the similarities and differences from the time-event model.