Counter-free input-determined timed automata


Autoria(s): Chevalier, Fabrice; D’Souza, Deepak; Prabhakar, Pavithra
Data(s)

01/10/2007

Resumo

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.

Formato

application/pdf

Identificador

http://eprints.iisc.ernet.in/41491/1/Counter-Fr.pdf

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

Publicador

Springer

Relação

http://www.springerlink.com/content/62g72m3683706n45/

http://eprints.iisc.ernet.in/41491/

Palavras-Chave #Computer Science & Automation (Formerly, School of Automation)
Tipo

Conference Paper

PeerReviewed