On the Decidability of Metric Temporal Logic
The work
| Authors | Joël Ouaknine; James Worrell |
|---|---|
| Editors | |
| Type | misc |
| Year | 2005 |
| Also known as | ouaknine2006decidability |
| Citekey | ouaknine2005decidability |
Where it appeared
| Published in | Proceedings - Symposium on Logic in Computer Science |
|---|---|
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 188--197 |
Identifiers
| DOI | 10.1109/lics.2005.33 |
|---|---|
| OpenAlex | W1775249002 |
Access
| Landing page | https://doi.org/10.1109/lics.2005.33 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
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. The question of the decidability of MTL over infinite words remains open.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-26 23:23 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@misc{ouaknine2005decidability,
title = {On the Decidability of Metric Temporal Logic},
author = {Joël Ouaknine and James Worrell},
year = {2005},
journal = {Proceedings - Symposium on Logic in Computer Science},
publisher = {Institute of Electrical and Electronics Engineers},
pages = {188--197},
doi = {10.1109/lics.2005.33},
}
This record lives at https://refs.drheap.org/ouaknine2005decidability/ and will keep
doing so. It used to be called ouaknine2006decidability, and those addresses still resolve to this one.