On Equivalences for a Class of Timed Regular Expressions | Zendy

Riccardo Pucella | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On Equivalences for a Class of Timed Regular Expressions

Author(s) -

Riccardo Pucella

Publication year - 2004

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2004.02.042

Subject(s) - coinduction , regular expression , equivalence (formal languages) , automaton , timed automaton , class (philosophy) , mathematics , regular language , extension (predicate logic) , discrete mathematics , computer science , algebra over a field , pure mathematics , theoretical computer science , programming language , mathematical proof , geometry , artificial intelligence

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 treatment of regular expressions based on deterministic automata. This yields a coinductive proof principle, that can be used to establish equivalence of a class of timed regular expressions

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research