The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
From OpenAlex, which stores abstracts as an
index of words and their positions: what is shown is rebuilt from that,
and reads fluently whether or not it is what the author wrote.
Abstract
In this article, we definetimed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to thetimed automataof Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation from automata to expressions. This result is extended from finite to infinite (in the sense of Büchi) behaviors. In addition to these fundamental results, we give a clean algebraic framework for two commonly accepted formalisms for timed behaviors, time-event sequences and piecewise-constant signals.
@article{asarin2002timed,
title = {Timed regular expressions},
author = {Eugene Asarin and Paul Caspi and Oded Maler},
year = {2002},
journal = {Journal of the ACM},
publisher = {Association for Computing Machinery},
volume = {49},
number = {2},
pages = {172--206},
doi = {10.1145/506147.506151},
}
This record lives at https://refs.drheap.org/asarin2002timed/ and will keep
doing so. It used to be called a2002timed, and those addresses still resolve to this one.