Automata, Logics, and Infinite Games

A Guide to Current Research

AvErich Grädel,Wolfgang Thomas

Häftad, Engelska, 2002

Del i serien Lecture Notes in Computer Science

788 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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.

Produktinformation

Utgivningsdatum:2002-12-13
Mått:155 x 233 x 22 mm
Vikt:604 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:392
Upplaga:2002
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540003885

Utforska kategorier

Systemvetenskap och AI inom Data och IT

Recensioner i media

From the reviews: "This book aims to be a 'Guide to Current Research.' ... it is a concise and uniform presentation of at least 50 papers, along with notes in various places that help the reader to put things together. It has a good bibliography ... . the book could be used as a textbook for an advanced graduate course or seminar. ... It would be a good choice for a seminar involving students." (Hans-Jorg Tiede, SIGACT News, Vol. 35 (1), 2004)

Innehållsförteckning

?-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.