On continuous timed automata with input-determined guards
Fabrice Chevalier, Deepak D'Souza, Pavithra Prabhakar
IISc-CSA-TR-2006-7
(June 2006) Available formats: [ps] [ps.gz]
Filed on June 27, 2006
Updated on June 29, 2006
We consider a general class of timed automata parameterized by a
set of "input-determined" operators, in a continuous time setting.
We show that for any such set of operators, we have a monadic second
order logic characterization of the class of timed languages
accepted by the corresponding class of automata.
Further, we consider natural timed temporal logics based on these
operators, and show that they are
expressively equivalent to the first-order fragment of the
corresponding MSO logics.
As a corollary of these general results we obtain an expressive
completeness result for the continuous version of MTL.
Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2006/7/.Problems ? Contact techrep@csa.iisc.ernet.in
[Updated at 2009-10-22T06:42Z]