Chevalier, Fabrice and D'Souza, Deepak and Prabhakar, Pavithra (2006) On continuous timed automata with input-determined guards. In: Proc. Confernece on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), , 2006, Kolkata.
On_continuous_timed.pdf - Published Version
Restricted to Registered users only
Download (181Kb) | Request a copy
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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||10 Nov 2011 05:52|
|Last Modified:||10 Nov 2011 05:52|
Actions (login required)