A Kleene theorem for splitable signals

Authors:
Jérôme Durand-Lose
Affiliations:
Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, 46, Allée d'Italie, 69364 Lyon Cedex 07, France and Université de Nice-Sophia Antipolis, F ...
Venue:
Information Processing Letters
Year:
2004

Citing 6
Cited 3

A theory of timed automata

Theoretical Computer Science
Accepting Zeno words: a way toward timed refinements

Acta Informatica
Timed regular expressions

Journal of the ACM (JACM)
Equations on Timed Languages

HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
A Kleene/Büchi-like theorem for clock languages

Journal of Automata, Languages and Combinatorics - Selected papers of the workshop on logic and algebra for concurrency
A Kleene theorem for timed automata

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Timed substitutions for regular signal-event languages

Formal Methods in System Design
Intersection of regular signal-event (timed) languages

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Refinements and abstractions of signal-event (timed) languages

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems

Quantified Score

Hi-index	0.89

Visualization

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.