Formal Modeling and Analysis of Timed Systems

Volume 4763 of the series Lecture Notes in Computer Science pp 82-97

Counter-Free Input-Determined Timed Automata

  • Fabrice ChevalierAffiliated withLaboratoire Spécification et Vérification, Ecole Normale Superieure de Cachan
  • , Deepak D’SouzaAffiliated withDept. of Computer Science & Automation, Indian Institute of Science, Bangalore 560012
  • , Pavithra PrabhakarAffiliated withDept. of Computer Science, University of Illinois at Urbana-Champaign

* Final gross prices may vary according to local VAT.

Get Access


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.