Specifying real-time properties with metric temporal logic
Real-Time Systems
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Determinizable Class of Timed Automata
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Counter-free input-determined timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
On continuous timed automata with input-determined guards
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |
We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator $\Diamond$. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class of ETA's and show that they compare favourably with other classes in the literature. Finally we show that class obtained using the dual operator $\Diamond\!\!\!\!\!-$ is also decidable, though the two operators together lead to an undecidable class of languages.