Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
From Finite Automata toward Hybrid Systems (Extended Abstract)
FCT '97 Proceedings of the 11th International Symposium on Fundamentals of Computation Theory
Proceedings of the Real-Time: Theory in Practice, REX Workshop
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
A logical characterization of data languages
Information Processing Letters
An algebraic approach to data languages and timed languages
Information and Computation
Compositional Abstractions of Hybrid Control Systems
Discrete Event Dynamic Systems
A Kleene theorem for splitable signals
Information Processing Letters
CONCUR 2005 - Concurrency Theory
Timed substitutions for regular signal-event languages
Formal Methods in System Design
On timed components and their abstraction
Proceedings of the 2007 conference on Specification and verification of component-based systems: 6th Joint Meeting of the European Conference on Software Engineering and the ACM SIGSOFT Symposium on the Foundations of Software Engineering
On the Merits of Temporal Testers
25 Years of Model Checking
MTL with Bounded Variability: Decidability and Complexity
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On Scheduling Policies for Streams of Structured Jobs
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
Categories of Timed Stochastic Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Volume and Entropy of Regular Timed Languages: Discretization Approach
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Volume and Entropy of Regular Timed Languages: Analytic Approach
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
On Equivalences for a Class of Timed Regular Expressions
Electronic Notes in Theoretical Computer Science (ENTCS)
On synthesizing controllers from bounded-response properties
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Distributed time-asynchronous automata
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
AMT: a property-based monitoring tool for analog systems
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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
Checking temporal properties of discrete, timed and continuous behaviors
Pillars of computer science
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Robust satisfaction of temporal logic over real-valued signals
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Kleene, Rabin, and Scott are available
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A controlled language for the specification of contracts
CNL'09 Proceedings of the 2009 conference on Controlled natural language
A Kleene-Schützenberger theorem for weighted timed automata
Theoretical Computer Science
The efficiency of identifying timed automata and the power of clocks
Information and Computation
Performance evaluation of schedulers in a probabilistic setting
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Real time temporal logic: past, present, future
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
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
Undecidable problems about timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Realtime regular expressions for analog and mixed-signal assertions
Proceedings of the International Conference on Formal Methods in Computer-Aided Design
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Undecidability Results for Timed Automata with Silent Transitions
Fundamenta Informaticae
| Hi-index | 0.01 |
In this article, we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to the timed automata of 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.