Fr. 97.00

Automata, Logics, and Infinite Games - A Guide to Current Research

Englisch · Taschenbuch

Versand in der Regel in 6 bis 7 Wochen

Beschreibung

Mehr lesen

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.

Inhaltsverzeichnis

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

Zusammenfassung

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.

Zusatztext

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-Jörg Tiede, SIGACT News, Vol. 35 (1), 2004)

Bericht

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-Jörg Tiede, SIGACT News, Vol. 35 (1), 2004)

Produktdetails

Mitarbeit E. Grädel (Herausgeber), Erich Grädel (Herausgeber), W. Thomas (Herausgeber), Wolfgan Thomas (Herausgeber), Wolfgang Thomas (Herausgeber), T. Wilke (Herausgeber), Thomas Wilke (Herausgeber)
Verlag Springer, Berlin
 
Sprache Englisch
Produktform Taschenbuch
Erschienen 20.02.2003
 
EAN 9783540003885
ISBN 978-3-540-00388-5
Seiten 392
Abmessung 161 mm x 236 mm x 22 mm
Gewicht 656 g
Illustration VIII, 392 p.
Serien Lecture Notes in Computer Science
Lecture Notes in Computer Science
Themen Naturwissenschaften, Medizin, Informatik, Technik > Informatik, EDV > Informatik

Informatik, C, Algorithms, computer science, Computer Science, general, complexity, Theory of Computation, Computers, Mathematical theory of computation, Mathematical logic, Automata, Systems Specification, Monadic Logic, automata theory, State-Based Systems

Kundenrezensionen

Zu diesem Artikel wurden noch keine Rezensionen verfasst. Schreibe die erste Bewertung und sei anderen Benutzern bei der Kaufentscheidung behilflich.

Schreibe eine Rezension

Top oder Flop? Schreibe deine eigene Rezension.

Für Mitteilungen an CeDe.ch kannst du das Kontaktformular benutzen.

Die mit * markierten Eingabefelder müssen zwingend ausgefüllt werden.

Mit dem Absenden dieses Formulars erklärst du dich mit unseren Datenschutzbestimmungen einverstanden.