Counter-free input-determined timed automata IISc-CSA-TR-2007-1
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
Available formats: [ps] [ps.gz]
Filed on January 29, 2007
Updated on February 2, 2007
We identify a class of timed automata, which we call counter-free
input-determined automata, which characterise the class of timed
languages definable by several timed temporal logics in the
literature, including MTL [AFH96,OW05].
We make use of this characterisation to show that MTL satisfies an
``ultimate stability'' property with respect to periodic sequences
of timed words.
Our results hold for both the pointwise and continuous semantics.
Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2007/1/.
Problems ? Contact email@example.com
[Updated at 2009-10-22T06:42Z]