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 …

We consider an extension of linear-time temporal logic (LTL) with constraints interpreted
over a concrete domain. We use a new automata-theoretic technique to show PSPACE …

Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …

Constraint LTL, a generalisation of LTL over Presburger constraints, is often used as a
formal language to specify the behavior of operational models with constraints. The freeze …

We present an overview of linear-time temporal logics with Presburger constraints whose
models are sequences of tuples of integers. Such formal specification languages are well …

We study algorithmic properties of first-order predicate monomodal logics of the frames (N,<)
and (N,≤) in languages with restrictions on the number of individual variables as well as the …

In this short survey, we present logical formalisms in which reasoning about concrete
domains is embedded in formulae at the atomic level. These include temporal logics with …

An alternation-free modal ì-calculus over data trees is introduced and studied. A data tree is
an unranked ordered tree whose every node is labelled by a letter from a finite alphabet and …

We study linear-time temporal logics interpreted over data words with multiple attributes. We
restrict the atomic formulas to equalities of attribute values in successive positions and to …

In a data word or a data tree each position carries a label from a finite alphabet and a data
value from an infinite domain. Over data words we consider the logic \sfLTL^↓_1(\rmF), that …