ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Counter-free input-determined timed automata

Chevalier, Fabrice and D’Souza, Deepak and Prabhakar, Pavithra (2007) Counter-free input-determined timed automata. In: FORMATS 2007, Salzburg, Austria, October 2007, Salzburg.

[img] PDF
Counter-Fr.pdf - Published Version
Restricted to Registered users only

Download (620kB) | Request a copy
Official URL: http://www.springerlink.com/content/62g72m3683706n...


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.

Item Type: Conference Paper
Publisher: Springer
Additional Information: Copyright of this article belongs to Springer.
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 17 Oct 2011 10:20
Last Modified: 17 Oct 2011 10:20
URI: http://eprints.iisc.ac.in/id/eprint/41491

Actions (login required)

View Item View Item