Skip to Main content Skip to Navigation
New interface
Reports (Research report)

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 (Research report)
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Colette ORANGE Connect in order to contact the contributor
Submitted on : Wednesday, April 17, 2019 - 9:13:27 AM
Last modification on : Wednesday, October 26, 2022 - 8:14:32 AM


Files produced by the author(s)


  • HAL Id : hal-02102067, version 1



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⟩



Record views


Files downloads