000 | 03834nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-36387-3 | ||
003 | DE-He213 | ||
005 | 20240423132518.0 | ||
007 | cr nn 008mamaa | ||
008 | 100301s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540363873 _9978-3-540-36387-3 |
||
024 | 7 |
_a10.1007/3-540-36387-4 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aAutomata, Logics, and Infinite Games _h[electronic resource] : _bA Guide to Current Research / _cedited by Erich Grädel, Wolfgang Thomas, Thomas Wilke. |
250 | _a1st ed. 2002. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2002. |
|
300 |
_aVIII, 392 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2500 |
|
505 | 0 | _a?-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. | |
520 | _aA 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. | ||
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aTheory of Computation. |
650 | 2 | 4 | _aComputer Science. |
700 | 1 |
_aGrädel, Erich. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aThomas, Wolfgang. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aWilke, Thomas. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540003885 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2500 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-36387-4 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c188564 _d188564 |