Overview

This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science.

Part I

Presenting the basics of discrete transition systems, including constructions and behavioural equivalences.

Part II

Examining the most important temporal logics for transition systems.

Part III

Looking at their expressiveness and complexity.

Part IV

Describing the main computational methods and decision procedures for model checking and model building — based on tableaux, automata, and games — and discussing their relationships.

The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography.

Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses.