Counter-Free Input-Determined Timed Automata

  • Fabrice Chevalier
  • Deepak D’Souza
  • Pavithra Prabhakar
Conference paper

DOI: 10.1007/978-3-540-75454-1_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4763)
Cite this paper as:
Chevalier F., D’Souza D., Prabhakar P. (2007) Counter-Free Input-Determined Timed Automata. In: Raskin JF., Thiagarajan P.S. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2007. Lecture Notes in Computer Science, vol 4763. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Fabrice Chevalier
    • 1
  • Deepak D’Souza
    • 2
  • Pavithra Prabhakar
    • 3
  1. 1.Laboratoire Spécification et Vérification, Ecole Normale Superieure de CachanFrance
  2. 2.Dept. of Computer Science & Automation, Indian Institute of Science, Bangalore 560012India
  3. 3.Dept. of Computer Science, University of Illinois at Urbana-ChampaignUSA

Personalised recommendations