When is Metric Temporal Logic Expressively CompleteReport as inadecuate



 When is Metric Temporal Logic Expressively Complete


When is Metric Temporal Logic Expressively Complete - Download this document for free, or read online. Document in PDF available to download.

Download or read this book online for free in PDF: When is Metric Temporal Logic Expressively Complete
A seminal result of Kamp is that over the reals Linear Temporal Logic LTL has the same expressive power as first-order logic with binary order relation and monadic predicates. A key question is whether there exists an analogue of Kamps theorem for Metric Temporal Logic MTL - a generalization of LTL in which the Until and Since modalities are annotated with intervals that express metric constraints. Hirshfeld and Rabinovich gave a negative answer, showing that first-order logic with binary order relation and unary function +1 is strictly more expressive than MTL with integer constants. However, a recent result of Hunter, Ouaknine and Worrell shows that with rational timing constants, MTL has the same expressive power as first-order logic, giving a positive answer. In this paper we generalize these results by giving a precise characterization of those sets of constants for which MTL and first-order logic have the same expressive power. We also show that full first-order expressiveness can be recovered with the addition of counting modalities, strongly supporting the assertion of Hirshfeld and Rabinovich that Q2MLO is one of the most expressive decidable fragments of FO



Author: Paul Hunter; Joël Ouaknine; James Worrell

Source: https://archive.org/



DOWNLOAD PDF




Related documents