Handling temporal grouping and pattern-matching queries in a temporal object model
Proceedings of the seventh international conference on Information and knowledge management
Journal of the ACM (JACM)
A logical characterization of data languages
Information Processing Letters
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Compilation and Synthesis for Real-Time Embedded Controllers
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Completeness and Decidability of a Fragment of Duration Calculus with Iteration
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Real-Time Automata and the Kleene Algebra of Sets of Real Numbers
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Algebraic Characterization of Data and Timed Languages
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Renaming is Necessary in Timed Regular Expressions
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A Complete Axiomatisation for Timed Automata
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Kleene Theorems for Event-Clock Automata
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
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
Automatic synthesis of a subclass of schedulers in timed systems
Theoretical Computer Science - Australasian computer science
An algebraic approach to data languages and timed languages
Information and Computation
A Kleene theorem for splitable signals
Information Processing Letters
On the completeness and decidability of duration calculus with iteration
Theoretical Computer Science
CONCUR 2005 - Concurrency Theory
Journal of Computer and System Sciences
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Timed substitutions for regular signal-event languages
Formal Methods in System Design
Some succinctness properties of Ω-DTAFA
SEPADS'06 Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Deciding an interval logic with accumulated durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A theory of duration calculus with application
Domain modeling and the duration calculus
Regular expressions with timed dominoes
DMTCS'03 Proceedings of the 4th international conference on Discrete mathematics and theoretical computer science
A Kleene-Schützenberger theorem for weighted timed automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
Intersection of regular signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Refinements and abstractions of signal-event (timed) languages
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Realtime regular expressions for analog and mixed-signal assertions
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
Understanding Basic Automata Theory in the Continuous Time Setting
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Bisimulation and Open Maps for Timed Transition Systems
Fundamenta Informaticae
| Hi-index | 0.00 |
In this paper we define timed regular expressions, and extension of regular expressions for specifying sets of dense-time discrete-valued signals. We show that this formalism is equivalent in expressive power to the timed automata of Alur and Dill by providing a translation procedure from expressions to automata and vice versa. the result is extended to /spl omega/-regular expressions (Buchi's theorem).