On Timed Automata with Input-Determined Guards

Souza, Deepak D and Tabareau, Nicolas (2004) On Timed Automata with Input-Determined Guards. [Book Chapter]

PDF On_time_BC_eb23rd.pdf Restricted to Registered users only Download (257Kb) | Request a copy

Abstract

We consider a general notion of timed automata with inputdetermined guards and show that they admit a robust logical framework along the lines of [6], in terms of a monadic second order logic characterisation and an expressively complete timed temporal logic. We then generalize these automata using the notion of recursive operators introduced by Henzinger, Raskin, and Schobbens [10], and show that they admit a similar logical framework. These results hold in the pointwise semantics. We finally use this framework to show that the real-time logic MITL of Alur et al [2] is expressively complete with respect to an MSO corresponding to an appropriate set of input-determined operators.

Item Type:	Book Chapter
Additional Information:	Copyright of this article belongs to Springer Verlag.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited:	25 Aug 2008
Last Modified:	19 Sep 2010 04:35
URI:	http://eprints.iisc.ernet.in/id/eprint/10095

Actions (login required)

View Item