Kooperativer Bibliotheksverbund

UID:

Umfang: VIII, 385 S.

ISBN: 3-540-00388-6

Serie: Lecture notes in computer science 2500 : Tutorial

Anmerkung: Includes index

Sprache: Englisch

Schlagwort(e): Informatik ; Logik ; Mathematisches Spiel ; Unendliches Spiel ; Zweipersonenspiel ; Büchi-Automat ; Unendliches Spiel ; Baumautomat ; Bewachte Logik ; Stufe 2 ; Model Checking ; My-Kalkül ; Logik ; Stufe 2 ; Monade ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung ; Aufsatzsammlung ; Konferenzschrift ; Aufsatzsammlung

URL: Inhaltsverzeichnis

URL: Kapitel 1

URL: Cover

URL: Inhaltstext

URL: http://www.loc.gov/catdir/enhancements/fy0817/2002044587-d.html

Mehr zum Autor: Grädel, Erich 1958-

Mehr zum Autor: Thomas, Wolfgang 1947-

UID:

Umfang: VIII, 392 p. , online resource.

Ausgabe: 1st ed. 2002.

ISBN: 9783540363873

Serie: Lecture Notes in Computer Science, 2500

Inhalt: 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.

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

In: Springer Nature eBook

Weitere Ausg.: Printed edition: ISBN 9783540003885

Sprache: Englisch

DOI: 10.1007/3-540-36387-4

URL: https://doi.org/10.1007/3-540-36387-4

UID:

Umfang: VIII, 392 p. , online resource.

ISBN: 9783540363873

Serie: Lecture Notes in Computer Science, 2500

Inhalt: 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.

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

In: Springer eBooks

Weitere Ausg.: Printed edition: ISBN 9783540003885

Sprache: Englisch

DOI: 10.1007/3-540-36387-4

URL: http://dx.doi.org/10.1007/3-540-36387-4

UID:

Umfang: Online-Ressource

ISBN: 9783540363873 , 3540003886

Serie: Lecture Notes in Computer Science 2500

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

Inhalt: 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.

Anmerkung: Lizenzpflichtig

Weitere Ausg.: ISBN 9783540003885

Weitere Ausg.: Buchausg. u.d.T. Automata, logics, and infinite games Berlin : Springer, 2002 ISBN 3540003886

Sprache: Englisch

Schlagwort(e): Unendliches Spiel ; Zweipersonenspiel ; Büchi-Automat ; Unendliches Spiel ; Baumautomat ; Bewachte Logik ; Stufe 2 ; Model Checking ; My-Kalkül ; Logik ; Stufe 2 ; Monade ; Aufsatzsammlung

DOI: 10.1007/3-540-36387-4

URL: Volltext  (lizenzpflichtig)

URL: Volltext  (lizenzpflichtig)

URL: Cover

URL: Inhaltsverzeichnis

URL: Kapitel 1

URL: Inhaltstext

Mehr zum Autor: Grädel, Erich 1958-

Mehr zum Autor: Wilke, Thomas 1965-