It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and that model checking the safety fragment of MTL-which includes invariance and time-bounded response properties-is also decidable.Expand

The main result of the paper is that, even for unordered data domains, each of the three verification problems for data nets without whole-place operations has non-elementary complexity.Expand

This paper surveys results about the complexity of the satisfiability and model checking problems for fragments of MTL with respect to different semantic models and shows that the most commonly occurring real-time properties can be expressed in fragments ofMTL for which model checking can be decided in polynomial or exponential space.Expand

An algorithm is given, based on linear programming, to calculate the distance between two states up to prescribed degree of accuracy and yields a quantitative notion of behavioural equivalence.Expand

It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and model checking the safety fragment of MTL--which includes invariance and time-bounded response properties--is also decidable.Expand

The problem of entailment in separation logic formulae is shown to be solved in polynomial time and it is shown that every satisfiable formula is equivalent to one whose graph is in a particular normal form.Expand

A pseudometric is presented on a class of reactive probabilistic transition systems yielding a quantitative notion of behavioural equivalence through the terminal coalgebra of a functor based on the Hutchinson metric on the space of Borel probability measures on a metric space.Expand

The crux of the proof consists in reducing the language inclusion problem to a reachability question on an infinite graph, and constructing a suitable well-quasi-order on the nodes of this graph, which ensures the termination of the search algorithm.Expand

It is shown that the problem of computing probabilistic bisimilarity is P-hard by reduction from the monotone circuit value problem and that the discounted pseudometric is rational and can be computed exactly in polynomial time using the network simplex algorithm and the continued fraction algorithm.Expand