A Kleene theorem for splitable signals |
| |
Authors: | Jérôme Durand-Lose |
| |
Affiliation: | a Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon Cedex 07, France b Université de Nice-Sophia Antipolis, France |
| |
Abstract: | In this paper, we consider timed automata for piecewise constant signals and prove that they recognize exactly the languages denoted by signal regular expressions with intersection and renaming. The main differences from the usual timed automata are: time elapses on transitions (passing through a state is instantaneous), signals may be split on a run on an automaton and constraints on transitions correspond to unions of open intervals but should be satisfied on closed intervals. This makes exact rendez-vous impossible. The paper stresses on the similarities and differences from the usual model. |
| |
Keywords: | Timed automata Piecewise constant signal Signal regular expression Formal languages |
本文献已被 ScienceDirect 等数据库收录! |
|