Muutke küpsiste eelistusi

Concise Introduction to Alternating-Time Temporal Logics: A Guide for Understanding the Model-Checking Problem [Kõva köide]

Teised raamatud teemal:
  • Kõva köide
  • Hind: 48,87 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,49 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 3-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Teised raamatud teemal:
The formal verification of multi-agent systems aimed at proving that such systems meet their specifications has given rise to a very active field of research at the crossroads of formal methods, knowledge representation and artificial intelligence. Alternating-time temporal logics are considered as one of the most popular and influential logical formalisms for strategic reasoning in multi-agent systems and have been introduced by Rajeev Alur, Thomas Henzinger and Orna Kupferman about 25 years ago. 



This textbook provides a concise presentation of alternating-time temporal logics dedicated to strategic reasoning in multi-agent systems. Dedicated mainly to the model-checking problem, the work examines developments about basic semantical properties of such logics, decision procedures and computational complexity. It provides results for solving optimally the model-checking problem on concurrent game structures by taking advantage ofor adapting proof methods fromtemporal logics, games in theoretical computer science and automata theory.



Topics and features:







Provides a unique teaching resource (typically for M1, M2 or PhD students), suitable for many courses such as Logic in Computer Science, Multi-Agent Systems, Formal Methods and Basics to Verification Fills a gap in the literature by presenting the standard results voluntarily exposed in a pedestrian style, as well as a few more recent results developed in full depth to prepare readers for examining more elaborate logical formalisms Includes detailed chapter examples, exercises (with solutions at the end), and a wealth of bibliographical references, thereby supporting self-study Offers a first unified presentation of alternating-time temporal logics in relation to games, automata and complexity



The textbook/guides target audience includes master students, PhD students and researchers that wish to have a thorough presentation of such logics and their relationships with automata theory, temporal logics, model-checking, energy games and complexity theory.



Stéphane Demri is a CNRS directeur de recherche at the Laboratoire Méthodes Formelles (LMF) and adjunct professor at the Computer Science Department, ENS Paris-Saclay, Gif-sur-Yvette, France.
Chapter 1 Introduction.- Chater 2 First Steps in Alternating-Time
Temporal Logics.
Chapter 3 Complexity of Model-Checking: from ATL to ATL*.-
Chpater 4 On Resources: the Energy Viewpoint.
Chapter 5 On the Energy LTL
Game Problem.
Current positions: directeur de recherche CNRS at the lab LMF, adjunct professor at ENS Paris-Saclay, France.



Teaching the topic of the book since 2019 for master students at ENS Paris-Saclay.



Two books as co-author:



1) Incomplete Information: Structure, Inference, Complexity, Stéphane Demri , Ewa Orlowska Springer, 2002



2) Temporal Logics in Computer Science, Stéphane Demri , Valentin Goranko , Martin Lange, Cambridge University Press, 2016