Publisher Summary From the early 1930s, there evolved two kinds of mathematical
semantics for modal logic. Algebraic semantics interprets modal connectives as operators …

This paper presents an overview of Transaction Logic—a new formalism recently introduced
in Bonner and Kifer (1992, 1993) and designed to deal with the phenomenon of state …

Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys
the singulax aclv~ ntage of being strongly related to classical logic. Its variants constitute …

The differences between and appropriateness of branching versus linear time temporal logic
for reasoning about concurrent programs are studied. These issues have been previously …

Publisher Summary This chapter focuses on finite automata on infinite sequences and
infinite trees. The chapter discusses the complexity of the complementation process and the …

We investigate extensions of temporal logic by connectives defined by finite automata on
infinite words. We consider three different logics, corresponding to three different types of …

It is first proved that there are properties of sequences that are not expressible in temporal
logic, even though they are easily expressible using, for instance, regular expressions …

In certain areas of artificial intelligence there is need to represent continuous change and to
make statements that are interpreted with respect to time intervals rather than time points. To …

A temporal language and system are presented which are based on branching time
structure. By the introduction of symmetrically dual sets of temporal operators, it is possible …

The problem of complementing Büchi automata arises when developing decision
procedures for temporal logics of programs. Unfortunately, previously known constructions …