On timed automata with input-determined guards

Details On timed automata with input-determined guards On timed automata with input-determined guards

2006-01-23

arxiv.org/abs/cs/0601096v1

Computer Science

Logic in Computer Science

Scientific paper

We consider a general notion of timed automata with input-determined guards and show that they admit a robust logical framework along the lines of [D 'Souza03], 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, 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 is expressively complete with respect to an MSO corresponding to an appropriate input-determined operator.

Affiliated with

Also associated with

No associations

Rating

On timed automata with input-determined guards does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On timed automata with input-determined guards, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On timed automata with input-determined guards will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-601196