Temporal logics in computer science : finite-state systems
Author(s)
Bibliographic Information
Temporal logics in computer science : finite-state systems
（Cambridge tracts in theoretical computer science, 58）
Cambridge University Press, 2016
- : hardback
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 716-736) and index
Description and Table of Contents
Description
This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses 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.
Table of Contents
- 1. Introduction
- Part I. Models: 2. Preliminaries and background I
- 3. Transition systems
- Part II. Logics: 4. Preliminaries and background II
- 5. Basic modal logics
- 6. Linear-time temporal logics
- 7. Branching-time temporal logics
- 8. The modal mu-calculus
- 9. Alternating-time temporal logics
- Part III. Properties: 10. Expressiveness
- 11. Computational complexity
- Part IV. Methods: 12. Frameworks for decision procedures
- 13. Tableaux-based decision methods
- 14. The automata-based approach
- 15. The game-theoretic framework
- References
- Index.
by "Nielsen BookData"