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

by Joel Ouaknine, James Worrell

Released as a article .

2007  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  345.7 kB
file_z52iofxirjgwfmv25cgeoxvevi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2007-02-22
Version   v2
Language   en ?
arXiv  cs/0702120v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3c1bd525-0657-469d-be4a-577df1bc05af
API URL: JSON