The declarative specification of business processes is based upon the elicitation of
behavioural rules that constrain the legal executions of the process. The carry-out of the …

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 …

Motivated by reasoning tasks for XML languages, the satisfiability problem of logics on data
trees is investigated. The nodes of a data tree have a label from a finite set and a data value …

In a data word each position carries a label from a finite alphabet and a data value from
some infinite domain. This model has been already considered in the realm of …

Abstract Metric Temporal Logic (MTL) is a widely-studied real-time extension of Linear
Temporal Logic. In this paper we survey results about the complexity of the satisfiability and …

In a data word each position carries a label from a finite alphabet and a data value from
some infinite domain. These models have been already considered in the realm of …

Graph databases have received much attention as of late due to numerous applications in
which data is naturally viewed as a graph; these include social networks, RDF and the …

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 …

Graph data models received much attention lately due to applications in social networks,
semantic web, biological databases and other areas. Typical query languages for graph …