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.[231, 233, 258] , Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures, Theoretical Computer Science 270 (2002), no. ... expressions for infinite trees and a standard form of automata, Computation Theory, Lecture Notes in Computer Science, vol. ... and finite machines, Proceedings of the 4th IEEE Symposioum on Switching Circuit Theory and Logical Design, 1963, pp.
|Title||:||Automata, Logics, and Infinite Games|
|Author||:||Erich Grädel, Wolfgang Thomas, Thomas Wilke|
|Publisher||:||Springer - 2003-08-02|