An overview of the tableau decision method for propositional temporal logic is presented.
The method is described in detail for linear time temporal logic. It is then discussed how it …

Being a survey, this paper summarizes the work of many authors, in particular joint work with
Z. Manna, H. Barringer, R. Kuiper, L. Zuck, and O. Lichtenstein, as well as independent work …

The paper studies the control of a class of discrete event processes, ie, processes that are
discrete, asynchronous and possibly nondeterministic. The controlled process is described …

Reactive systems are computing systems which are interactive, such as real-time systems,
operating systems, concurrent systems, control systems, etc. They are among the most …

We describe an automata-theoretic approach to the automatic verification of concurrent finite-
state programs by model checking. The basic idea underlying this approach is that for any …

This book is about the verification of reactive systems. A reactive system is a system that
maintains an ongoing interaction with its environment, as opposed to computing some final …

One of the serious criticisms directed against the Temporal Logic approach as represented
in [MPIJ,[MP2J and [OLJ is its inherent globality. By this we mean that we can only verify a …

An extension of propositional temporal logic that includes operators referring to a bounded
past is considered. An exponential time decision procedure and a complete axiomatic …

In this paper, Propositional Temporal Logic (PTL) is applied to the specification and
synthesis of the synchronization part of communicating processes. To specify a process, a …

We show that the class of properties of programs expressible in propositional temporal logic
can be substantially extended if we assume the programs to be data-independent. Basically …