On continuous timed automata with input-determined guards

Authors:
Fabrice Chevalier;Deepak D'Souza;Pavithra Prabhakar
Affiliations:
LSV, ENS de Cachan, Cachan Cedex, France;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India;Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India
Venue:
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2006

Citing 10
Cited 3

Specifying real-time properties with metric temporal logic

Real-Time Systems
A theory of timed automata

Theoretical Computer Science
The benefits of relaxing punctuality

Journal of the ACM (JACM)
Finite variability interpretation of monadic logic of order

Theoretical Computer Science
The Regular Real-Time Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Product Interval Automata: A Subclass of Timed Automata

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
State Clock Logic: A Decidable Real-Time Logic

HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
On the Decidability of Metric Temporal Logic

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Eventual timed automata

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

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

Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae
Counter-free input-determined timed automata

FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Undecidability Results for Timed Automata with Silent Transitions

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a general class of timed automata parameterized by a set of “input-determined” operators, in a continuous time setting. We show that for any such set of operators, we have a monadic second order logic characterization of the class of timed languages accepted by the corresponding class of automata. Further, we consider natural timed temporal logics based on these operators, and show that they are expressively equivalent to the first-order fragment of the corresponding MSO logics. As a corollary of these general results we obtain an expressive completeness result for the continuous version of MTL.