On the decidability and complexity of Metric Temporal Logic over finite words

Details On the decidability and complexity of Metric Temporal Logic over finite words On the decidability and complexity of Metric Temporal Logic over finite words

2007-02-21

arxiv.org/abs/cs/0702120v3

LMCS 3 (1:8) 2007

Computer Science

Logic in Computer Science

Scientific paper

10.2168/LMCS-3(1:8)2007

Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a given MTL formula. We show that this problem is decidable over finite words. Over infinite words, we show that model checking the safety fragment of MTL--which includes invariance and time-bounded response properties--is also decidable. These results are quite surprising in that they contradict various claims to the contrary that have appeared in the literature.

Affiliated with

Also associated with

No associations

Rating

On the decidability and complexity of Metric Temporal Logic over finite words 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 the decidability and complexity of Metric Temporal Logic over finite words, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the decidability and complexity of Metric Temporal Logic over finite words will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84076