DeepAI

# Revisiting Timed Logics with Automata Modalities

It is well known that (timed) ω-regular properties such as `p holds at every even position' and `p occurs at least three times within the next 10 time units' cannot be expressed in Metric Interval Temporal Logic (MITL) and Event Clock Logic (ECL). A standard remedy to this deficiency is to extend these with modalities defined in terms of automata. In this paper, we show that the logics EMITL_0,∞ (adding non-deterministic finite automata modalities into the fragment of MITL with only lower- and upper-bound constraints) and EECL (adding automata modalities into ECL) are already as expressive as EMITL (full MITL with automata modalities). In particular, the satisfiability and model-checking problems for EMITL_0,∞ and EECL are PSPACE-complete, whereas the same problems for EMITL are EXPSPACE-complete. We also provide a simple translation from EMITL_0,∞ to diagonal-free timed automata, which enables practical satisfiability and model checking based on off-the-shelf tools.

08/13/2018

### Timed context-free temporal logics

The paper is focused on temporal logics for the description of the behav...
10/09/2019

### Revisiting MITL to Fix Decision Procedures

Metric Interval Temporal Logic (MITL) is a well studied real-time, tempo...
06/29/2022

### Monitoring Timed Properties (Revisited)

In this paper we revisit monitoring real-time systems with respect to pr...
08/13/2018

### Timed context-free temporal logics (extended version)

The paper is focused on temporal logics for the description of the behav...
08/30/2017

### Model Checking Regular Language Constraints

Even the fastest SMT solvers have performance problems with regular expr...
06/28/2022

### On two-variable guarded fragment logic with expressive local Presburger constraints

We consider the extension of two-variable guarded fragment logic with lo...
07/27/2021

### Logics Meet 2-Way 1-Clock Alternating Timed Automata

In this paper, we study the extension of 1-clock Alternating Timed Autom...