Advertisement

Automata Logics, and Infinite Games

A Guide to Current Research

  • Erich Grädel
  • Wolfgang Thomas
  • Thomas Wilke

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Introduction

    1. Front Matter
      Pages 2-2
    2. Berndt Farwer
      Pages 3-21
    3. René Mazala
      Pages 23-38
    4. Back Matter
      Pages 39-40
  3. Determinization and Complementation

    1. Front Matter
      Pages 42-42
    2. Markus Roggenbach
      Pages 43-60
    3. Back Matter
      Pages 92-92
  4. Parity Games

    1. Front Matter
      Pages 94-94
    2. Ralf Küsters
      Pages 95-106
    3. Hartmut Klauck
      Pages 107-129
    4. Back Matter
      Pages 130-131
  5. Tree Automata

    1. Front Matter
      Pages 133-133
    2. Frank Nießner
      Pages 135-152
    3. Daniel Kirsten
      Pages 153-167
    4. Back Matter
      Pages 168-168
  6. Modal μ-Calculus

    1. Front Matter
      Pages 170-170
    2. Luca Alberucci
      Pages 185-201
    3. Back Matter
      Pages 202-203
  7. Monadic Second-Order Logic

    1. Front Matter
      Pages 205-205
    2. Mark Weyer
      Pages 207-230
    3. Back Matter
      Pages 258-259
  8. Tree-like Models

    1. Front Matter
      Pages 261-261
    2. Martin Leucker
      Pages 263-283
    3. Dietmar Berwanger, Achim Blumensath
      Pages 285-301
    4. Thierry Cachat
      Pages 303-317
    5. Back Matter
      Pages 318-318
  9. Guarded Logics

    1. Front Matter
      Pages 320-320
    2. Thoralf Räsch
      Pages 321-341
    3. Dietmar Berwanger, Achim Blumensath
      Pages 343-355
    4. Back Matter
      Pages 356-356
  10. Appendices

    1. Front Matter
      Pages 358-358
    2. Carsten Fritz
      Pages 359-364
  11. Back Matter
    Pages 365-385

About this book

Introduction

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 control systems.

For the construction and analysis of reactive systems an elegant and powerful theory has been developed based on automata theory, logical systems for the specification of nonterminating behavior, and infinite two-person games.

The 19 chapters presented in this multi-author monograph give a consolidated overview of the research results achieved in the theory of automata, logics, and infinite games during the past 10 years. Special emphasis is placed on coherent style, complete coverage of all relevant topics, motivation, examples, justification of constructions, and exercises.

Keywords

Büchi-Automat Computer Computer Science Logic Hardware Infinite Games Logical Calculi Mathematical Logic Monadic Logic State-Based Systems Systems Specification algorithms automata automata theory complexity computer science

Editors and affiliations

  • Erich Grädel
    • 2
  • Wolfgang Thomas
    • 3
  • Thomas Wilke
    • 1
  1. 1.Institut für Informatik und Praktische MathematikUniversität KielKielGermany
  2. 2.Mathematische Grundlagen der InformatikRWTH AachenAachenGermany
  3. 3.Lehrstuhl Informatik VIIRWTH AachenAachenGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-36387-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-00388-5
  • Online ISBN 978-3-540-36387-3
  • Series Print ISSN 0302-9743
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications