A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On Equivalences for a Class of Timed Regular Expressions
2004
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
Timed regular expressions are an extension of regular expressions that capture a notion of time. Roughly speaking, timed regular expressions can be used to represent timed sequences of events, with new operators to control the duration of those sequences. These timed regular expressions correspond to a form of timed automaton equipped with clocks, of the kind introduced by Alur and Dill. We develop a coalgebraic treatment of such timed regular expressions, along the lines of the coalgebraic
doi:10.1016/j.entcs.2004.02.042
fatcat:wi56llh5ynhoxnmur45hes6d3u