Automata, logics, and infinite games

A central aim and ever-lasting dream of computer science is to put the development of hardware and software systems on a mathematical basis which is both firm and practical. Such a scientific foundation is needed especially for the construction of reactive programs, like communication protocols or c...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר ראשי: Grädel, Erich, 1958-
מחברים אחרים: Thomas, Wolfgang, 1947-...., informaticien (Directeur de la publication), Wilke, Thomas, 1975- (Directeur de la publication)
פורמט: Livre numérique
שפה:Anglais
יצא לאור: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
סדרה:Lecture notes in computer science 2500
נושאים:
גישה מקוונת:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
הערה: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Automata, logics, and infinite games, Erich Grädel, Wolfgang Thomas, Thomas Wilke (eds.), 2002, Berlin, Springer, 1 vol. (VIII-385 p.), Lecture notes in computer science, 3-540-00388-6
תוכן הענינים:
  • ?-Automata
  • Infinite Games
  • Determinization and Complementation
  • Determinization of Büchi-Automata
  • Complementation of Büchi Automata Using Alternation
  • Determinization and Complementation of Streett Automata
  • Parity Games
  • Memoryless Determinacy of Parity Games
  • Algorithms for Parity Games
  • Tree Automata
  • Nondeterministic Tree Automata
  • Alternating Tree Automata and Parity Games
  • Modal ?-Calculus
  • Modal ?-Calculus and Alternating Tree Automata
  • Strictness of the Modal ?-Calculus Hierarchy
  • Monadic Second-Order Logic
  • Decidability of S1S and S2S
  • The Complexity of Translating Logic to Finite Automata
  • Expressive Power of Monadic Second-Order Logic and Modal ?-Calculus
  • Tree-like Models
  • Prefix-Recognizable Graphs and Monadic Logic
  • The Monadic Theory of Tree-like Structures
  • Two-Way Tree Automata Solving Pushdown Games
  • Guarded Logics
  • to Guarded Logics
  • Automata for Guarded Fixed Point Logics
  • Appendices
  • Some Fixed Point Basics.