Behavioral interface specification languages provide formal code-level annotations, such as
preconditions, postconditions, invariants, and assertions that allow programmers to express …

In this paper, we consider the robust interpretation of Metric Temporal Logic (MTL) formulas
over signals that take values in metric spaces. For such signals, which are generated by …

This chapter surveys timed automata as a formalism for model checking real-time systems.
We begin with introducing the model, as an extension of finite-state automata with real …

A data word is a sequence of pairs of a letter from a finite alphabet and an element from an
infinite set, where the latter can only be compared for equality. To reason about data words …

LNCS 4202 - From MITL to Timed Automata Page 1 From MITL to Timed Automata * Oded
Maler 1 , Dejan Nickovic 1 , and Amir Pnueli 2,3 1 Verimag, 2 Av. de Vignate, 38610 Gi`eres …

Transferring high-level knowledge from a source task to a target task is an effective way to
expedite reinforcement learning (RL). For example, propositional logic and first-order logic …

In this paper, we consider the robust interpretation of metric temporal logic (MTL) formulas
over timed sequences of states. For systems whose states are equipped with nontrivial …

We propose a novel framework for ontology-based access to temporal log data using a
datalog extension datalogMTL of the Horn fragment of the metric temporal logic MTL. We …

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 …

We discuss the use of various temporal knowledge representation formalisms for ontology-
mediated query answering over temporal data. In particular, we analyse ontology and query …