Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    UID:
    b3kat_BV015772109
    Format: VIII, 385 S.
    ISBN: 3540003886
    Series Statement: Lecture notes in computer science 2500 : Tutorial
    Note: Includes index
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: 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
    Author information: Grädel, Erich 1958-
    Author information: Thomas, Wolfgang 1947-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_BV015772109
    Format: VIII, 385 S.
    ISBN: 3-540-00388-6
    Series Statement: Lecture notes in computer science 2500 : Tutorial
    Note: Includes index
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: 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
    Author information: Grädel, Erich, 1958-
    Author information: Thomas, Wolfgang, 1947-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg
    UID:
    gbv_1649189656
    Format: Online-Ressource
    ISBN: 9783540363873 , 3540003886
    Series Statement: Lecture Notes in Computer Science 2500
    Content: ?-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.
    Content: 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.
    Note: Lizenzpflichtig
    Additional Edition: ISBN 9783540003885
    Additional Edition: Buchausg. u.d.T. Automata, logics, and infinite games Berlin : Springer, 2002 ISBN 3540003886
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Unendliches Spiel ; Zweipersonenspiel ; Büchi-Automat ; Unendliches Spiel ; Baumautomat ; Bewachte Logik ; Stufe 2 ; Model Checking ; My-Kalkül ; Logik ; Stufe 2 ; Monade ; Aufsatzsammlung
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Author information: Wilke, Thomas 1965-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_35838138X
    Format: VIII, 385 S. , graph. Darst.
    ISBN: 3540003886
    Series Statement: Lecture notes in computer science 2500
    Note: Literaturverz. S. [365] - 376
    Additional Edition: Erscheint auch als Online-Ausgabe Grädel, Erich Automata Logics, and Infinite Games Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2002 ISBN 9783540363873
    Additional Edition: ISBN 3540003886
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Unendliches Spiel ; Zweipersonenspiel ; Büchi-Automat ; Unendliches Spiel ; Baumautomat ; Bewachte Logik ; Stufe 2 ; Model Checking ; My-Kalkül ; Logik ; Stufe 2 ; Monade ; Konferenzschrift ; Aufsatzsammlung
    URL: Cover
    Author information: Wilke, Thomas 1965-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Book
    Book
    Berlin [u.a.] : Springer-Verlag
    UID:
    kobvindex_ZLB13465967
    Format: VIII, 385 Seiten , graph. Darst. , 24 cm
    ISBN: 3540003886
    Series Statement: Lecture notes in computer science 2500
    Note: Literaturverz. S. 365 - 376 , Text engl.
    Language: English
    Keywords: Unendliches Spiel ; Zweipersonenspiel ; Aufsatzsammlung ; Büchi-Automat ; Aufsatzsammlung ; Unendliches Spiel ; Baumautomat ; Bewachte Logik ; Stufe 2 ; Model Checking ; Aufsatzsammlung ; My-Kalkül ; Logik ; Stufe 2 ; Monade 〈Mathematik〉 ; Aufsatzsammlung ; Aufsatzsammlung ; Aufsatzsammlung
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    almahu_9948621616302882
    Format: VIII, 392 p. , online resource.
    Edition: 1st ed. 2002.
    ISBN: 9783540363873
    Series Statement: Lecture Notes in Computer Science, 2500
    Content: 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.
    Note: ?-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
    Additional Edition: Printed edition: ISBN 9783540003885
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9947920426102882
    Format: VIII, 392 p. , online resource.
    ISBN: 9783540363873
    Series Statement: Lecture Notes in Computer Science, 2500
    Content: 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.
    Note: ?-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
    Additional Edition: Printed edition: ISBN 9783540003885
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 3440003086?
Did you mean 3540000836?
Did you mean 3540003266?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages