On Equivalences for a Class of Timed Regular Expressions

Authors:
Riccardo Pucella
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY 14853 USA
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2004

Citing 15
Cited 0

A theory of timed automata

Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events

Journal of the ACM (JACM)
Models of nondeterministic regular expressions

Journal of Computer and System Sciences
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Timed regular expressions

Journal of the ACM (JACM)
Bialgebraic Modelling of Timed Processes

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Real-Time Behaviour of Asynchronous Agents

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
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
Origins and Metamorphoses of The Trinity: Logic, Nets, Automata

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Kleene theorem for timed automata

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Formal languages and their relation to automata

Formal languages and their relation to automata
Regular expressions with timed dominoes

DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.