Real-Time Automata
Real-Time Automata
We study here the class of timed automata with a single clock which is reset at each transition. We adapt for these automata the classical results for finite automata: the Kleene Theorem, the closure under complementation and the Pumping Lemma. We provide an algorithm for the elimination of stuttering steps, which is essential in complementation. This algorithm relies upon the properties of the Kleene algebra of sets of real numbers, namely the existence of a normal form for sets of reals generated from intervals with rational bounds, using boolean operations, summation and star.
Journal of Automata, Languages and Combinatorics, Volume 6, Number 1, 2001, 3-23
timed automata, Formal languages and automata, [INFO] Computer Science [cs]
timed automata, Formal languages and automata, [INFO] Computer Science [cs]
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).9 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!