A Kleene Theorem for Piecewise Constant Signals Automata - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2004

A Kleene Theorem for Piecewise Constant Signals Automata

Résumé

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.
Fichier principal
Vignette du fichier
rrLip-2002-43.pdf (159.44 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00079824 , version 1 (16-06-2006)

Identifiants

  • HAL Id : hal-00079824 , version 1

Citer

Jérôme Durand-Lose. A Kleene Theorem for Piecewise Constant Signals Automata. Information Processing Letters, 2004, 89(5), pp.237-245. ⟨hal-00079824⟩
83 Consultations
45 Téléchargements

Partager

Gmail Facebook X LinkedIn More