Some recent results in Metric Temporal Logic

Joël Ouaknine and James Worrell

Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear Temporal Logic. In this paper we survey results about the complexity of the satisfiability and model checking problems for fragments of MTL with respect to different semantic models. We show that these fragments have widely differing complexities: from polynomial space to non-primitive recursive and even undecidable. However we show that the most commonly occurring real-time properties, such as invariance and bounded response, can be expressed in fragments of MTL for which model checking, if not satisfiability, can be decided in polynomial or exponential space.

Proceedings of FORMATS 08 (invited paper), LNCS 5215, 2008. 13 pages.

PostScript / PDF © 2008 Springer-Verlag.

Imprint / Data Protection