Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

The name" temporal logic" may sound complex and daunting; but while they describe
potentially complex scenarios, temporal logics are often based on a few simple, and …

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 …

Publisher Summary This chapter presents many ways in which temporal phenomena can be
modeled, described, reasoned about, and applied. The chapter describes the use of …

Message sequence charts (MSCs) are an attractive visual formalism widely used to capture
system requirements during the early design stages in domains such as telecommunication …

In the classical Mazurkiewicz trace approach the behaviour of a concurrent system is
described in terms of sequential observations that differ only with respect to their ordering of …

The paper settles a long standing problem for Mazurkiewicz traces: the pure future local
temporal logic defined with the basic modalities exists-next and until is expressively …

We study the model-checking problem for classes of message sequence charts (MSCs)
defined by two extensions of message sequence graphs (MSGs). These classes subsume …

Linear temporal logic (LTL) is suitable not only for infinite-trace systems, but also for finite-
trace systems. In particular, LTL with finite-trace semantics is frequently used as a …