Counter-free input-determined timed automata

Authors:
Fabrice Chevalier;Deepak D'Souza;Pavithra Prabhakar
Affiliations:
Laboratoire Spécification et Vérification, Ecole Normale Superieure de Cachan, France;Dept. of Computer Science & Automation, Indian Institute of Science, Bangalore, India;Dept. of Computer Science, University of Illinois at Urbana-Champaign
Venue:
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Year:
2007

Citing 10
Cited 1

Specifying real-time properties with metric temporal logic

Real-Time Systems
The benefits of relaxing punctuality

Journal of the ACM (JACM)
The logic of event clocks: decidability, complexity and expressiveness

Automatica (Journal of IFAC)
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
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
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
On the expressiveness of MTL with past operators

FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Eventual timed automata

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

Model-checking Timed Temporal Logics

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal logics in the literature, including MTL. We make use of this characterization to show that MTL+Past satisfies an "ultimate stability" property with respect to periodic sequences of timed words. Our results hold for both the pointwise and continuous semantics. Along the way we generalize the result of McNaughton-Papert to show a counter-free automata characterization of FO-definable finitely varying functions.