A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract)

Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-lara.archives-ouvertes.fr/hal-02102067
Contributor : Colette Orange <>
Submitted on : Wednesday, April 17, 2019 - 9:13:27 AM
Last modification on : Wednesday, November 20, 2019 - 3:14:35 AM

File

RR2002-43.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02102067, version 1

Collections

Citation

Jérôme Durand-Lose. A Kleene Theorem for Piecewise Constant Signals Automata (extended abstract). [Research Report] LIp RR-2002-43, Laboratoire de l'informatique du parallélisme. 2002, 2+10p. ⟨hal-02102067⟩

Share

Metrics

Record views

4

Files downloads

9