DeepAI

# On the Expressiveness and Monitoring of Metric Temporal Logic

It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded signals). We then show that expressive completeness also holds in the general (time-unbounded) case if we allow the use of rational constants q ∈Q in formulas. This extended version of MTL therefore yields a definitive real-time analogue of Kamp's theorem. As an application, we propose a trace-length independent monitoring procedure for our extension of MTL, the first such procedure in a dense real-time setting.

• 3 publications
• 28 publications
• 35 publications
09/24/2020

### Successor-Invariant First-Order Logic on Classes of Bounded Degree

We study the expressive power of successor-invariant first-order logic, ...
05/30/2022

### LTL with Local and Remote Data Constraints

We consider an extension of linear-time temporal logic (LTL) with both l...
07/11/2022

### Order-Invariance in the Two-Variable Fragment of First-Order Logic

We study the expressive power of the two-variable fragment of order-inva...
11/30/2018

### A Metric for Linear Temporal Logic

We propose a measure and a metric on the sets of infinite traces generat...
03/14/2019

### A two-dimensional metric temporal logic

We introduce a two-dimensional metric (interval) temporal logic whose in...
09/17/2021

### Expressiveness of Extended Bounded Response LTL

Extended Bounded Response LTL with Past (LTLEBR+P) is a safety fragment ...
06/17/2022

### Relaxing safety for metric first-order temporal logic via dynamic free variables

We define a fragment of metric first-order temporal logic formulas that ...