LEADER 04167nam 22006255 450 001 996465276203316 005 20200703225000.0 010 $a3-540-36387-4 024 7 $a10.1007/3-540-36387-4 035 $a(CKB)1000000000211810 035 $a(SSID)ssj0000321489 035 $a(PQKBManifestationID)11255094 035 $a(PQKBTitleCode)TC0000321489 035 $a(PQKBWorkID)10279518 035 $a(PQKB)10809300 035 $a(DE-He213)978-3-540-36387-3 035 $a(MiAaPQ)EBC3072685 035 $a(PPN)155206265 035 $a(EXLCZ)991000000000211810 100 $a20100301d2002 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Logics, and Infinite Games$b[electronic resource] $eA Guide to Current Research /$fedited by Erich Grädel, Wolfgang Thomas, Thomas Wilke 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (VIII, 392 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2500 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-00388-6 320 $aIncludes bibliographical references and index. 327 $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. 330 $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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2500 606 $aComputers 606 $aComputer science 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Science, general$3https://scigraph.springernature.com/ontologies/product-market-codes/I00001 615 0$aComputers. 615 0$aComputer science. 615 14$aTheory of Computation. 615 24$aComputer Science, general. 676 $a004/.01/51 702 $aGrädel$b Erich$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aThomas$b Wolfgang$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aWilke$b Thomas$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465276203316 996 $aAutomata logics and infinite games$9953858 997 $aUNISA