Monadic second order logic (MSOL) over transition systems is considered. It is shown that
every formula of MSOL which does not distinguish between bisimilar models is equivalent to …

We describe an efficient decentralized monitoring algorithm that monitors a distributed
program's execution to check for violations of safety properties. The monitoring is based on …

This article describes some mathematical methods for verifying properties of programs in
higher-order, functional languages. We focus on methods for reasoning about equivalence …

Partial order reductions is a family of techniques for diminishing the state-space explosion
problem for model-checking concurrent programs. It is based on the observation that …

A basic result concerning LTL, the propositional temporal logic of linear time, is that it is
expressively complete; it is equal in expressive power to the first order theory of sequences …

Data structures basic in language theory are words, that is, strings of elements, letters. Here
the idea of a “string” entails a linear order among the elements. The double helix of DNA …

Message sequence charts (MSCs) is a standard notation for describing the interaction
between communicating objects. It is popular among the designers of communication …

We study linear time temporal logics of multiple agents, where the temporal modalities are
local. These modalities not only refer to local next-instants and local eventuality, but also …

With agents relying more and more on information from central servers rather than their own
sensors, knowledge becomes property not of a specific agent but of the data that the agents …

In this paper we have attempted an overview of linear time temporal logics interpreted over
traces. We have mainly concentrated on the satisfiability and model checking problems as …