Temporal Logics in Computer Science
Finite-State Systems
Published on 28. September 2016
978-1-316-72856-7 (ISBN)
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.
Reviews / Votes
'In summary, the book presents the most important and influential temporal logics, presents their properties, and introduces the most important tools to reason about temporal logics. It strikes a good balance between breadth and depth in coverage ...' Martin Zimmermann, MathSciNetMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 180 Line drawings, black and white
File size
10,99 MB
ISBN-13
978-1-316-72856-7 (9781316728567)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Stephane Demri | Valentin Goranko | Martin Lange
Temporal Logics in Computer Science
Finite-State Systems
Book
10/2016
Cambridge University Press
€136.50
Article not available at the moment
Persons
Stephane Demri is a CNRS directeur de recherche at the Laboratoire Specification et Verification (LSV), Ecole Normale Superieure de Cachan, and he is currently the head of LSV. His current research interests include verification of infinite-state systems, temporal logics and analysis of systems with data. He has participated in numerous international and national projects and has been co-responsible for bilateral projects with Poland, South Africa and Australia. He is regularly involved in teaching, in program committees, in steering committees and in editorial boards. He has co-authored more than 125 publications in the field of formal/logical methods for analysing computer systems, including a monograph, 4 edited proceedings, 6 book chapters and 50 articles in international journals. Valentin Goranko is currently a professor of logic and theoretical philosophy at Stockholm University. He has more than 30 years of university teaching and research experience in mathematics, computer science and philosophy in universities in Bulgaria, South Africa, Denmark and Sweden. His main expertise and research interests are in theory and applications of modal and temporal logics to computer science, artificial intelligence, multiagent systems and philosophy. He has authored and co-authored more than 100 publications, including two recent textbooks on logic and discrete mathematics. He is a member of several editorial boards and steering bodies of professional organisations and is currently the vice-president of the Association for Logic, Language and Information (FoLLI). Martin Lange is currently a professor in theoretical computer science at the University of Kassel, Germany. His research interests include model checking and general decision procedures for logics in computer science with a focus on temporal logics. He has published more than 80 papers in international journals and conference proceedings. He received an ERC Starting Grant in 2010 and a Heisenberg professorship from the German Research Council in 2013.
Content
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.
