Fr. 97.00

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

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

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.

List of contents

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

Summary

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.

Additional text

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)

Report

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)

Product details

Assisted by E. Grädel (Editor), Erich Grädel (Editor), W. Thomas (Editor), Wolfgan Thomas (Editor), Wolfgang Thomas (Editor), T. Wilke (Editor), Thomas Wilke (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 20.02.2003
 
EAN 9783540003885
ISBN 978-3-540-00388-5
No. of pages 392
Dimensions 161 mm x 236 mm x 22 mm
Weight 656 g
Illustrations VIII, 392 p.
Series Lecture Notes in Computer Science
Lecture Notes in Computer Science
Subjects Natural sciences, medicine, IT, technology > IT, data processing > IT

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

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.